#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#include "horses.h"
ll N;
vector<ll> X, Y, DP;
ll solve() {
DP.resize(N);
ll cur = X[0];
DP[0] = cur * Y[0];
for(ll i = 1; i < N; i++) {
cur *= X[i];
DP[i] = max(DP[i-1], cur * Y[i]);
}
// cout << DP[N-1] << endl;
return DP[N-1];
}
int init(int N, int X[], int Y[]) {
::N = N;
::X.resize(N), ::Y.resize(N);
for(int i = 0; i < N; i++) {
::X[i] = X[i];
::Y[i] = Y[i];
}
return solve();
}
int updateX(int pos, int val) {
X[pos] = val;
return solve();
}
int updateY(int pos, int val) {
Y[pos] = val;
return solve();
}
