#include <bits/stdc++.h>

using namespace std;

// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
typedef pair<ll, vector<ll>> Pd;

const ll INF = 1e18;
const ll fact_table = 320000;

priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;

// small priority queue
// top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
//↓,→,↑,←

#define p(x) cout << x << "\n";
#define el cout << "\n";
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = a; i <= (b); i++)
#define rep3(i, a, b) for (ll i = a; i >= (b); i--)
#define all(c) begin(c), end(c)
#define sorti(v) sort(all(v))
#define sortd(v)                                                               \
    sort(all(v));                                                              \
    reverse(all(v));
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

// vec v(n) -> 長さnのベクトルを宣言
// mat dp(h, vec(w)) -> h * w の行列を宣言

// const ll mod = 1000000007ll;
const ll mod = 998244353ll;

ll mypow(ll a, ll b, ll m = mod) {
    ll x = 1;
    while (b) {
        while (!(b & 1)) {
            (a *= a) %= m;
            b >>= 1;
        }
        (x *= a) %= m;
        b--;
    }
    return x;
}
vec rv(ll read) {
    vec res(read);
    for (int i = 0; i < read; i++) {
        cin >> res[i];
    }
    return res;
}
/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}

ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod) * rfact[n - r]) % mod;
}
*/

bool icpc = false;
bool multicase = false;

ll n;
bool used[400005];
map<ll, vec> mp;

bool solve() {
    cin >> n;
    n *= 2;
    vector<P> table;
    for (int i = 0; i < n; i++) {
        int value;
        cin >> value;
        table.pb({value, i});
    }
    sortd(table);
    for (int i = 0; i < n / 2; i++) {
        int idx = table[i].second;
        used[idx] = true;
    }
    vec v;
    for (int i = 0; i < n; i++) {
        int now = (used[i]) ? 1 : 0;
        bool push = false;
        if (v.size() == 0) {
            push = true;
        } else if (v.back() == now) {
            push = true;
        } else {
            push = false;
        }
        if (push) {
            pu("(");
            v.pb(now);
        } else {
            pu(")");
            v.pop_back();
        }
    }
    el;

    return true;
}

/*







*/

int main() {
    // ios::sync_with_stdio(false);
    // cin.tie(nullptr);
    if (icpc) {
        while (solve())
            ;
        return 0;
    }
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // cout << "Case #" << testcase << ": ";
        solve();
        testcase++;
    }

    // solve();
    return 0;
}
    #include <bits/stdc++.h>
    using namespace std;
    #define rep(i,a,b) for(int i=(a);i<=(b);++i)
    #define FI freopen("/home/empathy/in.txt", "r", stdin)
    #define FO freopen("/home/empathy/out.txt", "w", stdout)
    template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
    template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
    void dbg_out() { cerr << endl; }
    template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
    #ifdef QUICKRUN
    #define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
    #else
    #define dbg(...)
    #endif
    typedef long long ll;
    typedef pair<int, int> ii;

    bool check(vector<int> arr, ll base, ll M) {
        __int128_t res = 0;
        for (int i = 0; i < arr.size(); ++i) {
            if (res > (M - arr[i]) / base) return true;
            res = res * base + arr[i];
            if (res > M || res < 0) return true;
        }
        return false;
    }

    __int128_t binarySearch(vector<int> arr, ll l, ll M) {
        ll r = M + 1;
        while (r - l > 1) {
            ll mid = l + (r - l) / 2;
            if (check(arr, mid, M)) r = mid;
            else l = mid;
            dbg(r);
        }
        return r;
    }

    void solve() {
        string X;
        cin >> X;
        ll M;
        cin >> M;
        int ma = 0;
        int n = int(X.length());
        vector<int> arr(n);
        for (int i = 0; i < n; ++i) {
            arr[i] = X.at(i) - '0';
            if (arr[i] > ma) ma = arr[i];
        }
        ll cnt = 0;
        if (n != 1) {
            cnt = binarySearch(arr, 1, M);
            dbg(cnt);
            cnt -= ma + 1;
            if (cnt < 0) cnt = 0;
        }
        else {
            if (arr[0] > M) cnt = 0;
            else cnt = 1;
        }
        cout << cnt << '\n';
    } 

    int main() {
        ios::sync_with_stdio(false);
    #ifndef QUICKRUN
        cin.tie(nullptr);
    #endif
    #ifdef QUICKRUN
        FI;
        // FO;
    #endif
        solve();
        return 0;
    }
