哭出来了

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
long long d[200005];
long long a[200005],b[200005];
int n;
int cnt=0,ans,any;
int zero; 
inline bool eql(double a,double b){
	return fabs(a-b)<1e-18;
}
int main(){
    scanf("%d",&n);
    for(register int i=1;i<=n;i++){
    	scanf("%lld",&a[i]);
	}
    for(register int i=1;i<=n;i++){
    	scanf("%lld",&b[i]);
    	b[i]*=(2e9);
	}
    for(register int i=1;i<=n;i++){
        if(a[i]==0){
        	zero++;
        	d[i]=-2000000000000000001;
        	if(b[i]==0) any++;
        	continue;
		}
        d[i]=b[i]/a[i];
    }
    //for(register int i=1;i<=n;i++) printf("%Lf",d[i]);
    std::sort(d+1,d+1+n);
    for(register int i=1;i<=n;i++) std::cout<<d[i]<<" ";
    for(register int i=1+zero;i<=n+1;i++){
        if(d[i]==d[i-1]){
            cnt++;
        }
        else{
            ans=ans>cnt?ans:cnt;
            cnt=1;
        }
    }
    printf("%d",ans+any);
    return 0;
}