#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "horses.h"
ll n ;
ll a[500009],cost[500009];
ll tree[2000009];
ll merge ( ll x , ll y ){
x%=mod;
y%=mod;
return (x*y)%mod;
}
void build(ll node,ll l,ll r){
if ( l == r ){
tree[node] = a[l];
return ;
}
build(node*2,l,mid);
build(node*2+1,mid+1,r);
tree[node] = merge ( tree[node*2] , tree[node*2+1] ) ;
}
void upd(ll node,ll l,ll r,ll id){
if ( l==r ){
tree[node]=a[l];
return ;
}
if ( id<=mid ) upd(node*2,l,mid,id);
else upd(node*2+1,mid+1,r,id);
tree[node] = merge ( tree[node*2] , tree[node*2+1] ) ;
}
ll query(ll node,ll l,ll r,ll s,ll e){
if ( l>r || s>r || e<l ) return 1;
if ( s<=l && e>=r ) return tree[node];
return merge( query(node*2,l,mid,s,e) , query(node*2+1,mid+1,r,s,e) );
}
ll solve(){
ll st = 0;
ll crnt =1 ;
for ( int i =n-1 ;i>=0 ;i-- ){
crnt*=a[i];
if ( crnt > (ll)2e9 ) break;
st = i ;
}crnt = 1;
ll ans = 0;
if ( st ) ans = cost[st-1];
for( int i =st ;i < n;i ++ ){
crnt *= a[i];
ans = max ( ans, crnt * cost[i]);
}
ans %= mod ;
ans *= query ( 1 , 0 , n-1 , 0 , st-1 ) ;
ans %= mod ;
return ans;
}
int init(int N, int X[], int Y[]) {
n = N;
for ( int i =0 ;i < n ;i ++ ) a[i]=X[i];
for ( int i =0 ;i < n ;i ++ ) cost [i] = Y [i];
build(1,0,n-1);
return solve();
}
int updateX(int pos, int val) {
a[pos]=val;
upd(1,0,n-1,pos);
return solve();
}
int updateY(int pos, int val) {
cost[pos]=val;
return solve();
}
