t = int(input())
n = list(map(int,input().split()))
res = 1
for i in range(t):
if n[i]==0:
res = 0
break
res*=n[i]
print(res)
#include <iostream>
#include <bits/stdc++.h>
#define WINNABLE ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PRINTVP(vp) for(auto &i:vp)cout<<i.first<<" "<<i.second<<endl;
#define PRINTV(v) for(auto &i:v)cout<<i<<" ";
#define endl '\n'
typedef long long ll;
using namespace std;
bool notBeautiful(string s) {
int ones = 0;
for(char c : s) {
if((c - '0') > 1)
return true;
if((c - '0') == 1)
ones++;
}
if(ones > 1)
return true;
return false;
}
int main()
{
int n; cin >> n;
string s, zeros, nbtfl = "1";
if(n == 1) {
cin >> s;
return cout << s, 0;
}
for(int i = 0; i < n; i++) {
cin >> s;
if(s == "0")
return cout << 0, 0;
if(notBeautiful(s)) {
nbtfl = s;
}
else {
for(char c : s) {
if((c - '0') == 0)
zeros += '0';
}
}
}
cout << nbtfl << zeros;
}
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |