#include <bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
typedef long long lld;
int N;
int A[MAXN];
lld dfs(vector<int> &arr, bool last_zero)
{
if (sz(arr) == 1){
lld ret = 0;
for (int i=1;i<10;i++) if (arr[0] & (1 << i)){
ret = ret*10 + i;
if ((arr[0] & 1) && ret) ret *= 10, arr[0] ^= 1;
}
if (arr[0] & 1) ret = ret ? ret*10 : 10;
return ret ? ret : last_zero;
}
lld ret = 123456789000000L;
for (int i=0;i<10;i++){
vector <int> nxt = {0};
int k = i;
for (int t: arr){
if (k == 10) k = 0, nxt.pb(0);
int &b = nxt[sz(nxt)-1];
b |= t ^ (t & (1 << k));
k++;
}
while (sz(arr) > 1 && !arr.back()) arr.pop_back();
if (sz(arr) == 2 && i == 9 && arr == nxt) continue;
ret = min(ret, dfs(nxt, i ? 0 : (arr[0] & 1)) * 10 + i);
}
return ret;
}
int main()
{
scanf("%d", &N);
for (int i=0;i<N;i++) scanf("%d", A+i);
vector <int> tmp;
for (int i=0;i<N;i++) tmp.pb(1 << A[i]);
lld ans = dfs(tmp, 1);
printf("%lld\n", ans ? ans : 10);
}
