#include <bits/stdc++.h>
#define N 200050
using namespace std;
int n, m, i, j, k, a[N], b[N], c[N], d[N], p[N];
int main(){
scanf("%d", &n);
for(i=1; i<=n; i++){
scanf("%d", &a[i]);
c[a[i]]++;
}
for(i=1; i<=n; i++){
scanf("%d", &b[i]);
d[b[i]]++, p[b[i]] = i;
}
for(i=1; i<=n; i++){
if(c[i] != d[i]) break;
if(c[i] > 1) k = 1;
}
if(i <= n) printf("No\n");
else if(k) printf("Yes\n");
else{
for(i=1; i<=n-2; i++){
if(a[i] == b[i]) continue;
k = p[a[i]];
for(j=i+1; j<=n; j++){
if(j != k) break;
}
swap(a[i], a[j]);
swap(b[k], b[j]);
p[b[k]] = k, p[b[j]] = j;
swap(a[i], a[j]);
swap(b[i], b[j]);
p[b[i]] = i, p[b[j]] = j;
}
if(a[i] == b[i]) printf("Yes\n");
else printf("No\n");
}
return 0;
}