#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1000005;
struct node{
	int c,id,val;
}s[N];
bool cmp1(node a,node b){return a.val<b.val;}
bool cmp2(node a,node b){return a.id<b.id;}
int st[N],top;
int main(){
	int n;
	scanf("%d",&n);n<<=1;
	for(int i=1;i<=n;i++) scanf("%d",&s[i].val),s[i].c=0,s[i].id=i;
	sort(s+1,s+n+1,cmp1);
	for(int i=n/2+1;i<=n;i++) s[i].c=1;
	sort(s+1,s+n+1,cmp2);
	int nl=-1;
	for(int i=1;i<=n;i++){
		if(nl==-1) nl=s[i].c,putchar('('),st[++top]=s[i].id;
		else if(s[i].c==nl) putchar('('),st[++top]=s[i].id;
		else putchar(')'),st[top--]=0;
		if(!top) nl=-1;
	}
	putchar('\n'); 
}
//#define NDEBUG

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

  using i32 = std::int32_t;
  using i64 = std::int64_t;
  using u32 = std::uint32_t;
  using u64 = std::uint64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class F> class rec_lambda {
    F f;

  public:
    rec_lambda(F&& f) : f(std::move(f)) {}
    template <class... Args> auto operator()(Args&&... args) const {
      return f(*this, std::forward<Args>(args)...);
    }
  };
  template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }
  constexpr char eoln = '\n';
  template <class T> T ceildiv(const T& l, const T& r) {
    return l / r + (l % r != 0 ? 1 : 0);
  }

} // namespace n91

#include <numeric>

namespace n91 {

  void main_() {
    /*
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    //*/
    const usize n = scan<usize>();
    std::vector<i64> a(n), b(n);
    i64 base = 0;
    std::vector<i64> c(n);
    for (auto& e : a) {
      std::cin >> e;
    }
    for (auto& e : b) {
      std::cin >> e;
    }
    for (const usize i : rep(0, n)) {
      i64 x = a[i], y = b[i];
      if (i % 2 == 1) {
        std::swap(x, y);
      }
      base += x;
      c[i] = y - x;
    }
    std::nth_element(c.begin(), c.begin() + n / 2, c.end(), std::greater<i64>());
    base += std::accumulate(c.begin(), c.begin() + n / 2, i64(0));
    std::cout << base << eoln;
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}
