#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll A[202020],B[202020];
const ll mo=1000000007;

ll modpow(ll a, ll n = mo-2) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

bool comp(pair<ll,ll> L,pair<ll,ll> R) {
	return L.first*R.second<L.second*R.first;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>A[i];
	vector<pair<ll,ll>> V;
	ll S=0;
	FOR(i,N) {
		cin>>B[i];
		if(A[i]<0) {
			A[i]=-A[i];
			B[i]=-B[i];
		}
		if(A[i]) {
			V.push_back({B[i],A[i]});
			S+=A[i];
		}
	}
	sort(ALL(V),comp);
	
	S/=2;
	FORR2(a,b,V) {
		if(S<=b) {
			ll ret=a*modpow(b)%mo;
			ret=(ret%mo+mo)%mo;
			cout<<ret<<endl;
			break;
		}
		S-=b;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}