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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N; cin >> N;
    vector<int> P(N);
    for(auto &a : P) cin >> a,a %= N;
    
    vector<vector<vector<int>>> cycle(N+1);
    vector<bool> already(N);
    for(int i=0; i<N; i++) if(!already.at(i)){
        vector<int> now;
        int pos = P.at(i);
        while(already.at(pos) == false) now.push_back(pos),already.at(pos) = true,pos = P.at(pos);
        cycle.at(now.size()).emplace_back(now);
    }
    vector<int> Q(N);
    for(int i=1; i<=N; i++){
        if(i%2 == 0 && cycle.at(i).size()%2){cout << "No\n"; return 0;}
        if(i%2 == 0){
            while(cycle.at(i).size()){
                auto C1 = cycle.at(i).back(); cycle.at(i).pop_back();
                auto C2 = cycle.at(i).back(); cycle.at(i).pop_back();
                for(int k=0; k<i; k++) Q.at(C1.at(k)) = C2.at(k),Q.at(C2.at(k)) = C1.at(k);
            }
        }
        else{
            int inc = 0,p2 = 1;
            while((inc+p2)%i) inc = (inc+p2)%i,p2 += p2;
            for(auto &C : cycle.at(i)) for(int k=0; k<i; k++) Q.at(C.at((k+i-1%i)%i)) = C.at((k+inc)%i);
        }
    }
    
    for(auto &q : Q) q = (q-1+N)%N;
    cout << "Yes\n";
    for(int i=0; i<N; i++) cout << Q.at(i)+1 << (i==N-1?"\n":" ");
}