？

#include<bits/stdc++．h>
#define ll long long
#define rt return
using namespace std;
const int N = 1e6+5; 
ll a[N],b[N],n,q,p,minleft,minright;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n;i++){
		cin>>b[i];
	}
	minleft=n+1;
	minright=n+1;
	for(int i=1;i<=n;i++){
		if(a[i]==0){
			minleft=min(minleft,abs(q-i));
		}
		else if(a[i]==0){
			minright=min(minright,abs(q-i));
		}
	}
    rt 0;
}