#include <bits/stdc++.h>
#define dbg(x) cerr << #x << ':' << (x) << endl; 
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(),x.end()

int main()
{
    map<string, int> mp;
    auto add = [](string s) -> string
    {
        int n = s.size();
        reverse(s.begin(), s.end());
        vector<int> a(n);
        for (int i = 0; i < n; ++i) a[i] = s[i] - '0';
        for (int i = 0; i < a.size(); ++i)
        {
            if (i < n) a[i] += s[i] - '0';
            if (a[i] >= 10)
            {
                if (i + 1 < a.size()) a[i + 1] += 1;
                else a.push_back(1);
                a[i] %= 10;
            }
        }
        string ret(a.size(), '0');
        for (int i = 0; i < a.size(); ++i) ret[i] += a[i];
        reverse(ret.begin(), ret.end());
        return ret;
    };

    auto f = [&]() -> void
    {
        string s = "1";
        mp[s] = 0;
        for (int i = 1; i <= 200; ++i)
        {
            s = add(s);
            mp[s] = i;
        }
    };
    f();
    // for (auto [str, id] : mp) cout << str << ' ' << id << endl;
    
    int n;
    cin >> n;
    vector<string> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    vector<int> s1,s2;

    for (int i = 0; i < n; i++) s1.emplace_back(mp[a[i]]);

    while (s1.size() > 1) {
        while (!s1.empty()) {
            int tmp = s1.back();
            s1.pop_back();
            while (!s2.empty() && s2.back() == tmp) {
                ++tmp;
                s2.pop_back();
            }
            s2.emplace_back(tmp);
        }

        if (s2.size() == 1) {
            s1 = s2;
            break;
        }

        int mn = *min_element(ALL(s2));

        s1.clear();
        for (int i = 0; i < s2.size(); i++) {
            if (s2[i] != mn) s1.emplace_back(s2[i]);
        }
        s2.clear();
    }

    for (auto [str,id] : mp) {
        if (s1[0] == id) cout << str << endl;
    }

    return 0;
}