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

int dp[1001][1001][10][2];
int a[1001], b[1001], apsum[1001];

int range_sum(int l, int r) {
    if (l > r) return 0;
    return apsum[r] - apsum[l - 1];
}

const int inf = 0x3f3f3f3f;

void solve() {
    int n;
    cin >> n;
    memset(dp, 0x3f3f3f3f, sizeof dp);
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];
    for (int i = 1; i <= n; i++) apsum[i] = apsum[i - 1] + a[i];

    dp[0][0][0][0] = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= i; j++) {
            for (int k = 0; k < 10; k++) {
                // cout << i << " " << j << " " << k << " ==== \n";
                int diff = k + b[i + 1];
                int lo = j, hi = i + 1;  // possible range: [j, i + 1]
                while (lo + 1 < hi) {
                    int mid = (lo + hi) >> 1;
                    if (range_sum(j + 1, mid) >= diff) hi = mid;
                    else lo = mid;
                }
                int cur_diff = diff - range_sum(j + 1, lo);
                // cout << "curdiff: " << diff << " - " << range_sum(j + 1, lo) << " = " << cur_diff << "\n";
                // cout << "add: " << range_sum(j + 1, lo) << " (" << j + 1 << " ~ " << lo << ")\n";
                if (dp[i][j][k][0] != inf) {
                    // cout << "!: " << dp[i][j][k][0] << "\n";
                    if (cur_diff < 10) {
                        dp[i + 1][lo][cur_diff][1] = min(dp[i + 1][lo][cur_diff][1], dp[i][j][k][0]) + b[i + 1];
                        // cout << i + 1 << " " << lo << " " << cur_diff << " 1: " << dp[i + 1][lo][cur_diff][1] << "\n";
                    }
                }
                if (dp[i][j][k][1] != inf) {
                    // cout << "!: " << dp[i][j][k][1] << "\n";
                    dp[i + 1][j][k][0] = min(dp[i + 1][j][k][0], dp[i][j][k][1]);
                    if (cur_diff < 10) {
                        dp[i + 1][lo][cur_diff][1] = min(dp[i + 1][lo][cur_diff][1], dp[i][j][k][1]) + b[i + 1];
                        // cout << i + 1 << " " << lo << " " << cur_diff << " 1: " << dp[i + 1][lo][cur_diff][1] << "\n";
                    }
                    // cout << i + 1 << " " << j << " " << k << " 0: " << dp[i + 1][j][k][0] << "\n";
                }
            }
        }
    }

    int ans = 1e9;
    for (int j = 0; j < n; j++) {
        for (int k = 0; k < 10; k++) {
            for (int l = 0; l < 2; l++) {
                ans = min(ans, dp[n][j][k][l] + range_sum(j + 1, n));
            }
        }
    }
    cout << ans << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    solve();
    return 0;
}