#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
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; }
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define CIN(c) cin >> (c)
#define COUT(c) cout << (c) << '\n'
#define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
ll llceil(ll a, ll b) { return (a + b - 1) / b; }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
string toupper(const string& S) { string T(S); REP(i,SZ(T)) T[i] = toupper(T[i]); return T; }
string tolower(const string& S) { string T(S); REP(i,SZ(T)) T[i] = tolower(T[i]); return T; }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
static const double EPS = 1e-10;
static const double PI  = acos(-1.0);
static const ll MOD = 1000000007;
// static const ll MOD = 998244353;
static const ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;

// Editorial AC

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N; cin >> N;
    VLL A(N); REP(i,N) cin >> A[i];
    VLL B(N); REP(i,N) cin >> B[i];

    VLL E,O;  // Even,Odd
    REP(i,N) {
        if (i % 2 == 0) {
            E.push_back(B[i] - A[i]);
        } else {
            O.push_back(B[i] - A[i]);
        }
    }
    RSORT(E); RSORT(O);

    ll score = SUMLL(A);
    ll ans = score;
    REP(i,N/2) {
        score += E[i] + O[i];
        chmax(ans, score);
    }
    COUT(ans);

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;

int main() {
    int n; cin >> n;
    vector<int> a(2 * n);
    for(auto &e : a) cin >> e;

    vector<P> ps;
    rep(i, 2 * n) ps.emplace_back(a[i], i);
    sort(ps.rbegin(), ps.rend());

    vector<int> p(2 * n, -1);
    rep(i, n) p[ps[i].second] = 1;

    string ans(2 * n, 'x');

    int l = 0, r = 0;
    int cnt_p = 0, cnt_m = 0;
    string st = "";
    rep(i, 2 * n) {
        if(st.empty()) {
            st +='(';
            ans[i] = '(';
            l++;
            if(p[i] == 1) cnt_p++;
            else cnt_m++;
        } else {
            if(cnt_p) {
                if(p[i] == 1) {
                    cnt_p++;
                    st += '(';
                    ans[i] = '(';
                } else {
                    cnt_p--;
                    st.pop_back();
                    ans[i] = ')';
                }
            } else if(cnt_m) {
                if(p[i] == -1) {
                    cnt_m++;
                    st += '(';
                    ans[i] = '(';
                } else {
                    cnt_m--;
                    st.pop_back();
                    ans[i] = ')';
                }
            }
        }
    }

    cout << ans << '\n';
    return 0;
}
