和上一题一样,这样的operation会使得数列的奇偶性不变,那么只需要判断两个数列排列的奇偶性就可以;
特别的:如果两个数列的多重集不相同,那么一定不对;
如果多重集相同,而且数列中有相同的数,那么一定是对的。
// Problem: B - Triple Shift
// Contest: AtCoder - AtCoder Regular Contest 136
// URL: https://atcoder.jp/contests/arc136/tasks/arc136_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define lowbit(x) (x&-x)
#define pf(a) printf("%d\n",a)
#define mem(x,y) memset(x,y,sizeof(x))
#define dbg(x) cout << #x << " = " << x << endl
#define rep(i,l,r) for(int i = l; i <= r; i++)
#define fep(i,a,b) for(int i=b; i>=a; --i)
#define PII pair<int,int>
//#define long long in
typedef long long ll;
const int N = 1e6+10;
int n,m;
int a[N], b[N];
int v[N], s[N];
void solve()
{
cin >> n;
rep(i,1,n) {
cin >> a[i];
v[i] = a[i];
}
rep(i,1,n) {
cin >> b[i];
s[i] = b[i];
}
sort(v+1,v+1+n);
sort(s+1,s+1+n);
rep(i,1,n) {
if(v[i]!=s[i]) {
puts("No");
return;
}
}
rep(i,2,n) {
if(a[i-1] == a[i]) {
puts("Yes");
return;
}
}
int inv = 0;
rep(i,1,n) rep(j,i+1,n) if(a[i]>a[j]) inv ^= 1;
rep(i,1,n) rep(j,i+1,n) if(b[i]>b[j]) inv ^= 1;
if(!inv) puts("Yes");
else puts("No");
}
int main()
{
solve();
return 0;
}