#include using namespace std; using ll = long long; using VI = vector; using VL = vector; using VS = vector; using VVI = vector>; using VVL = vector>; using PII = std::pair; using PLL = std::pair; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d)) #define allpt(v) (v).begin(), (v).end() #define allpt_c(v) (v).cbegin(), (v).cend() #define allpt_r(v) (v).rbegin(), (v).rend() const int mod = 1e9 + 7, mod2 = 998244353; const ll inf = 1e18; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; template void show1dvec(const vector &v) { if (v.size() == 0) return; int n = v.size() - 1; rep(i, n) cout << v[i] << wsp; cout << v[n] << rt; ; return; } template void show2dvec(const vector> &v) { int n = v.size(); rep(i, n) show1dvec(v[i]); } template void show1dpair(const vector> &v) { int n = v.size(); rep(i, n) cout << v[i].first << wsp << v[i].second << rt; return; } template void pairzip(const vector> &v, vector &t, vector &s) { int n = v.size(); rep(i, n) { t.push_back(v[i].first); s.push_back(v[i].second); } return; } template void maxvec(vector &v) { T s = v[0]; int n = v.size(); rep(i, n - 1) { if (s > v[i + 1]) { v[i + 1] = s; } s = v[i + 1]; } } template bool myfind(T t, S s) { return find(t.cbegin(), t.cend(), s) != t.cend(); } bool check(int y, int x, int h, int w) { return 0 <= y && y < h && 0 <= x && x < w; } VL cumsum(const VL &v) { int s = 0; VL ret = {0}; rep(i, v.size()) { s += v[i]; ret.push_back(s); } return ret; } bool iskadomatsu(int a, int b, int c) { return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c)); } void shave(vector &v, int k, int n) { vector x, y; int n_sq = sqrt(n) + 1; for (int i = 3; i < n + 1; i += 2) { x.push_back(i); } for (int i = 3; i < n_sq; i += 2) { for (auto itr = x.cbegin(); itr != x.cend(); itr++) { if (*itr == i || *itr % i != 0) y.push_back(*itr); } x.clear(); x = y; y.clear(); } if (n >= 2 && k <= 2) v.push_back(2); for (auto itr = x.cbegin(); itr != x.cend(); itr++) { if (*itr >= k) v.push_back(*itr); } } int main() { #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif int n, m, level, turn, ans, maxk; cin >> n; ans = n; priority_queue, greater> monsters, monsters2; VI enemies(n); PII z; rep(i, n) { cin >> m; monsters2.push(make_pair(m, 0)); } rep(i, n) cin >> enemies[i]; rep(k, n) { monsters = monsters2; rep(i, n) { z = monsters.top(); monsters.pop(); level = z.first, turn = z.second; level += enemies[(k + i) % n] / 2; turn++; monsters.push(make_pair(level, turn)); } maxk = 0; rep(i, n) { z = monsters.top(); monsters.pop(); maxk = max(maxk, z.second); } ans = min(ans, maxk); } cout << ans << rt; return 0; }