Codeforces Problem 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.

Examples

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.

大数乘法，但因为有了美丽的数的概念，难度退化到模拟。

基本思路是最多一个不美的数，其他要么0，要么1，要么100.......0。不美的数单独记录，0，1特判，其他的记录下0的数量，最后输出。

这道题我被题目坑了，原文写着输入都是integer，我误以为都是int类型，结果发现远远超过了。

另外，任何题都要想好思路再上，比如，全都是不美丽的数怎么办？这种问题在一开始就应该想好，而不是写到最后发现WA再去思考。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<queue>
#include<cmath>
#include<climits>
#include<sstream>
#include<algorithm>
using namespace std;
int n,ans_0,temp,iszero,length_input,isugly;
char input[100000+10];
char ans[100000+10];
bool isbeautiful(void)
{
   //char temp[20];
    int length,num_1=0,num_others=0;
    //sprintf(temp,"%d",x);
    length=length_input;
    for(int i=0;i<length;i++)
    {
        if(input[i]=='1')
            num_1++;
        if(input[i]>'1')
            num_others++;
    }
    if((num_others!=0)||(num_1>1))
        return false;
    else
        return true;
}
int find_0(void)
{
    int length,num_0=0;
    //sprintf(temp,"%d",x);
    length=length_input;
    num_0=length-1;
    return num_0;
}
int main(void)
{
    int temp_0;
    cin>>n;
    ans_0=0;
    iszero=0;
    //ans=1;
    isugly=0;
    while(n--)
    {

        scanf("%s",input);
        length_input=strlen(input);
        if((length_input==1)&&(input[0]=='0'))
        {
            iszero=1;
            break;
        }
        if((length_input==1)&&(input[0]=='1'))
            continue;
        {
            if(isbeautiful())
            {
                temp_0=find_0();
                ans_0+=temp_0;
            }
            else
            {
                for(int j=0;j<length_input;j++)
                    ans[j]=input[j];
                ans[length_input]='\0';
                isugly=1;
            }
        }

    }
    if(iszero)
        printf("0");
    else
    {
        if(isugly)
            printf("%s",ans);
        else
            printf("1");
        for(int i=0;i<ans_0;i++)
            printf("%d",0);

    }

    return 0;
}