#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<queue>
#include<stack>
#include<utility>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<list>
#include<tuple>
using namespace std;

typedef long long ll;
typedef long double ld;

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

#define FOR(i, a, b) for(ll i=(a); i<(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n+1)

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }


int main(void){
    ll N; cin>>N;
    vl A(2*N);
    REP(i,2*N) cin>>A[i];
    vl B=A;
    sort(B.begin(),B.end());
    
    ll med=B[N-1],cnt=0;
    REP(i,N){
        if(B[i]==med) cnt++;
    }
    
    vl code(2*N);
    REP(i,2*N){
        if(A[i]<=med){
            if(A[i]<med) code[i]=-1;
            else if(cnt>0) code[i]=-1, cnt--;
            else code[i]=1;
        }
        else code[i]=1;
    }
    
    ll nowc=0, sum=0;
    string S;
    REP(i,2*N){
        if(nowc==0){
            if(code[i]>0) nowc=1;
            else nowc=-1;
        }
        
        if(nowc>0){
            if(code[i]>0) S+='(', sum++;
            else S+=')', sum--;
        }
        else{
            if(code[i]<0) S+='(', sum++;
            else S+=')', sum--;
        }
        
        if(sum==0) nowc=0;
    }
    cout<<S<<endl;
    return 0;
}
#include <bits/stdc++.h>
#define ll long long
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define all(x) (x).begin(),(x).end()
using namespace std;

int main(){
    ll k;
    cin>>k;
    ll ans=0;
    V dp(2e5+1,0);
    for(ll a=1;a<=2e5;a++){
        ll res=0;
        for(ll b=1;b*b<=a;b++){
            if(a%b==0){
                res++;
                if(b*b!=a)res++;
            }
        }
        dp[a]=dp[a-1]+res;
    }
    for(ll i=1;i<=k;i++){
        ll maxi=k/i;
        ans+=dp[maxi];
    }
    cout<<ans<<endl;
}
