#include "horses.h"
#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
using namespace std;
long long n,a[500500],b[500500],mod=1e9+7,tree[2005000],mxtree[2005000];
multiset<pair<int,long long> >ms;
long long qrx(int nod,int l,int r,int x,int y)
{
if(x<=l&&r<=y)return tree[nod];
else if(r<x||y<l)return 1ll;
int mid=(l+r)/2;
return (qrx(nod*2,l,mid,x,y)*qrx(nod*2+1,mid+1,r,x,y))%mod;
}
long long qry(int nod,int l,int r,int x,int y)
{
if(x<=l&&r<=y)return mxtree[nod];
else if(r<x||y<l)return 0ll;
int mid=(l+r)/2;
return max(qry(nod*2,l,mid,x,y),qry(nod*2+1,mid+1,r,x,y));
}
long long slov()
{
long long x=1,ans=0;
if(ms.size()==0)return qry(1,0,n+5,0,n-1);
multiset<pair<int,long long> >::iterator it=--ms.end(),st;
while(true)
{
pair<int,long long>z=*it;
long long in=z.first,val=z.second;
x*=val;
if(x>=(long long)2e9)break;
st=it;
if(it==ms.begin())break;
it--;
}
x=1;
long long ml=1;
pair<int,long long>az=*st;
if(az.first)
{
ml=qrx(1,0,n+5,0,az.first-1);
ans=b[az.first-1];
}
for(st;st!=ms.end();st++)
{
pair<int,long long>z=*st;
long long ind=z.first,val=z.second,nxt;
x*=val;
if(st==--ms.end())nxt=n;
else
{
pair<int,long long>zz=*(++st);
st--;
nxt=zz.first;
}
long long mx=x*b[ind];
ans=max(ans,mx);
}
ans%=mod;
for(int i=0;i<az.first;i++)
{
ans*=a[i];
ans%mod;
}
return ans;
}
void upy(int nod,int l,int r,int x,long long val)
{
if(x<l||r<x)return;
if(l==r)
{
mxtree[nod]=val;
return;
}
int mid=(l+r)/2;
upy(nod*2,l,mid,x,val);
upy(nod*2+1,mid+1,r,x,val);
mxtree[nod]=max(mxtree[nod*2],mxtree[nod*2+1]);
}
void upx(int nod,int l,int r,int x,long long val)
{
if(x<l||r<x)return;
if(l==r)
{
tree[nod]=val;
return;
}
int mid=(l+r)/2;
upx(nod*2,l,mid,x,val);
upx(nod*2+1,mid+1,r,x,val);
tree[nod]=(tree[nod*2]*tree[nod*2+1])%mod;
}
int init(int N, int X[], int Y[])
{
n=N;
for(int i=0;i<n;i++)
{
a[i]=X[i];
b[i]=Y[i];
ms.insert({i,a[i]});
upx(1,0,n+5,i,a[i]);
upy(1,0,n+5,i,b[i]);
}
return slov();
}
int updateX(int pos, int val)
{
ms.erase(ms.lower_bound({pos,a[pos]}));
a[pos]=val;
ms.insert({pos,a[pos]});
upx(1,0,n+5,pos,val);
return slov();
}
int updateY(int pos, int val)
{
b[pos]=val;
upy(1,0,n+5,pos,val);
return slov();
}
