#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> cost;

int consistency1(int n) {
    vector<int> dp(n + 1, INF);
    
    dp[0] = 0; 

    for (int i=1; i<=n; i++) {
    	
        for (int j=0; j<=n; j++) {
            int left = max(0LL, j - a[j]);
            int right = min(n, j + a[j]);

            if (left <= i && right >= i) {
                if (dp[left] != INF) {
                    dp[i] = min(dp[i], dp[left] + cost[j]);
                }
            }
        }
    }
    
    return dp[n] == INF ? -1 : dp[n];
}




//? Optimization 

int consistency2(int n) {
    vector<int> dp(n + 1, INF);
    
    dp[0] = 0; 

    for (int i=1; i<=n; i++) {
    	
    	int start = max(0LL, i-100);
    	int end = min(n, i+100);
    	
        for (int j=start; j<=end; j++) {
            int left = max(0LL, j - a[j]);
            int right = min(n, j + a[j]);

            if (left <= i && right >= i) {
                if (dp[left] != INF) {
                    dp[i] = min(dp[i], dp[left] + cost[j]);
                }
            }
        }
    }
    
    return dp[n] == INF ? -1 : dp[n];
}











int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n+1);
    for(int i=0; i<=n; i++) cin >> a[i];
    
    cost.resize(n+1);
    for(int i=0; i<=n; i++) cin >> cost[i];
    
    cout << consistency1(n) << " " << consistency2(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}