CodeForces 614B Gena's Code

B. Gena's Code

time limit per test

0.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

It's the year 4527 and the tanks game that we all know and love still exists. There also exists Great Gena's code, written in 2016. The problem this code solves is: given the number of tanks that go into the battle from each country, find their product. If it is turns to be too large, then the servers might have not enough time to assign tanks into teams and the whole game will collapse!

There are exactly n distinct countries in the world and the i-th country added a_i tanks to the game. As the developers of the game are perfectionists, the number of tanks from each country is beautiful. A beautiful number, according to the developers, is such number that its decimal representation consists only of digits '1' and '0', moreover it contains at most one digit '1'. However, due to complaints from players, some number of tanks of one country was removed from the game, hence the number of tanks of this country may not remain beautiful.

Your task is to write the program that solves exactly the same problem in order to verify Gena's code correctness. Just in case.

Input

The first line of the input contains the number of countries n (1 ≤ n ≤ 100 000). The second line contains n non-negative integers a_i without leading zeroes — the number of tanks of the i-th country.

It is guaranteed that the second line contains at least n - 1 beautiful numbers and the total length of all these number's representations doesn't exceed 100 000.

Output

Print a single number without leading zeroes — the product of the number of tanks presented by each country.

Sample test(s)

Input

3
5 10 1

Output

50

Input

4
1 1 10 11

Output

110

Input

5
0 3 1 100 1

Output

0

Note

In sample 1 numbers 10 and 1 are beautiful, number 5 is not not.

In sample 2 number 11 is not beautiful (contains two '1's), all others are beautiful.

In sample 3 number 3 is not beautiful, all others are beautiful.

模拟题

题目大意，给几个数，定义像这种一个1后面全是零的整百整千整万的叫美丽的数。如：1，100，1000000，1000000000

确保给出的数里只有一个不美丽的数，求这些数的乘积。

方法,分类

第一类，0，那么就不用继续了，直接输出0

第二类，美丽的数，统计美丽数后面0的个数，最后直接输出后面的0

第三类，不美丽的数，因为题目确保只有一个，所以只要把这个数记下来就行了。

最后输出的答案要么是0，要么就是不美丽的数加后面的0

#include <stdio.h>
#include <string.h>
const int MAXN=100005;
char s[MAXN],inBeautifulNum[MAXN];

bool isBeautiful()
{
        if(strlen(s)==1)
                return true;
        for(int i=1;i<strlen(s);i++)
                if(s[i]!='0')
                        return false;
        return true;
}
int main()
{
        int n,zeroCnt=0,isZero=0;
        scanf("%d",&n);
        strcpy(inBeautifulNum,"1");
        while(n--)
        {
                scanf("%s",s);
                if(s[0]=='0')
                {
                        isZero=1;
                        break;
                }
                else if(s[0]=='1'&&isBeautiful())
                {
                        zeroCnt+=strlen(s)-1;
                        continue;
                }
                else
                        strcpy(inBeautifulNum,s);
        }
        if(isZero)
                printf("0");
        else
        {

                int len=strlen(inBeautifulNum);
                printf("%s",inBeautifulNum);
                for(int i=len;i<len+zeroCnt;i++)
                        printf("0");
        }
        printf("\n");
        return 0;
}