#include<bits/stdc++.h>
using namespace std;

const int MOD = 1000000007;

long bimod(int x, int exp){
    long res = 1, mul = x;
    for(long i = exp; i > 0; i >>= 1){
        if(i & 1) res = (res * mul) % MOD;
        mul = (x * x) % MOD;
    }
    return res;
}

int main(){
    int n, a[100000], i; cin >> n;
    long sum = 0, ans;
    for(i = 0; i < n; i++){
        cin >> a[i];
        sum = (sum + a[i]) % MOD;
    }
    
    long bmd = bimod(2, n-1);
    
    long a_n[100000] = {1, 1,}, s_n_2 = 1;
    for(i = 2; i < n ; i++){
        a_n[i] = s_n_2 % MOD, s_n_2 = (s_n_2 + a_n[i-1]) % MOD;
    }
    
    ans = sum;
    long afp, afm, af;
    for(i = 1; i < n; i++){
        af = (a_n[i] * a_n[n-i]) % MOD;
        afp = (sum * a_n[n-i]) % MOD;
        afm = (a[n-i] * af * 2) % MOD;
        ans = (ans + afp - afm + MOD) % MOD; 
    }

    cout << ans << endl;

    return 0;
}
//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<ll>a(n),b(n);
  rep(i,0,n){
    cin>>a[i];
    res+=a[i];
  }
  rep(i,0,n){
    cin>>b[i];
    b[i]=b[i]-a[i];
  }
  vector<vector<ll>>v(2);
  rep(i,0,n){
    v[i&1].PB(b[i]);
  }
  sort(ALLR(v[0]));
  sort(ALLR(v[1]));
  rep(i,0,v[0].size()){
    if(v[0][i]+v[1][i]>0)res+=v[0][i]+v[1][i];
  }
  cout<<res<<endl;
  return 0;
}