#include "bits/stdc++.h"
using namespace std;

int main(){
  int n;
  cin>>n;
  vector<int> a(n+1,0);
  vector<int> ansa(n+1);
  vector<int> b(n+1,0);
  vector<int> ansb(n+1);
  for(int i=0;i<n;i++){
    cin>>ansa[i];
    a[ansa[i]]++;
  }
  for(int i=0;i<n;i++){
    cin>>ansb[i];
    b[ansb[i]]++;
  }
  int ans=-1;
  for(int i=1;i<=n;i++){
    if(b[i]==0){
      ans=i;
      break;
    }
  }
  //cout<<ans<<endl;
  if(ans==-1){
    cout<<"Yes"<<endl;
  }else{
    cout<<"No"<<endl;
    for(int i=0;i<n;i++){
      cout<<ansb[i];
      if(i!=n-1)cout<<" ";
    }
    cout<<endl;
    for(int i=0;i<n;i++){
      if(ansa[i]==ans){
        if(ansb[i]==n){
          cout<<ansb[i]-1;
        }else{
          cout<<ansb[i]+1;
        }
      }else{
        cout<<ansb[i];
      }
      if(i!=n-1)cout<<" ";
    }
    cout<<endl;
  }
}


### Prompt

Please formulate a cpp solution to the following problem:

problem

AOR Ika made a set $ S = \\ {a_1, ..., a_N \\} $ and a map $ f: S → S $. $ f (a_i) = b_i $. For any element $ x $ in the set $ S $, all maps $ g, h: S → S $ satisfying $ g (f (x)) = h (f (x)) $ are $ g (x). ) = Determine if h (x) $ is satisfied, and if not, configure one counterexample.





Example

Input

5
1 2 3 4 5
3 4 2 5 1


Output

Yes

### Response

```cpp
#include "bits/stdc++.h"
using namespace std;

int main(){
  int n;
  cin>>n;
  vector<int> a(n+1,0);
  vector<int> ansa(n+1);
  vector<int> b(n+1,0);
  vector<int> ansb(n+1);
  for(int i=0;i<n;i++){
    cin>>ansa[i];
    a[ansa[i]]++;
  }
  for(int i=0;i<n;i++){
    cin>>ansb[i];
    b[ansb[i]]++;
  }
  int ans=-1;
  for(int i=1;i<=n;i++){
    if(b[i]==0){
      ans=i;
      break;
    }
  }
  //cout<<ans<<endl;
  if(ans==-1){
    cout<<"Yes"<<endl;
  }else{
    cout<<"No"<<endl;
    for(int i=0;i<n;i++){
      cout<<ansb[i];
      if(i!=n-1)cout<<" ";
    }
    cout<<endl;
    for(int i=0;i<n;i++){
      if(ansa[i]==ans){
        if(ansb[i]==n){
          cout<<ansb[i]-1;
        }else{
          cout<<ansb[i]+1;
        }
      }else{
        cout<<ansb[i];
      }
      if(i!=n-1)cout<<" ";
    }
    cout<<endl;
  }
}


```