#include <bits/stdc++.h>
#include <vector>

using namespace std;

int main() {
    int N;
    cin >> N;
    vector<int> A(N + 1);
    for (int i = 1; i <= N; i++) {
        cin >> A[i];
    }

    vector<vector<int>> jump_count(N + 1, vector<int>(N + 1, 0));
    vector<bool> visited(N + 1, false);
    int total_distance = 0;

    for (int start = 1; start <= N; ++start) {
        if (visited[start]) continue;

        vector<int> trace;
        int current = start;
        while (!visited[current]) {
            visited[current] = true;
            trace.push_back(current);
            current = A[current];
        }

        int cycle_index = find(trace.begin(), trace.end(), current) - trace.begin();
        int cycle_length = trace.size() - cycle_index;

        for (int i = 0; i < trace.size(); ++i) {
            for (int j = i; j < trace.size(); ++j) {
                jump_count[trace[i]][trace[j]] = j - i;
                if (i != j) {
                    jump_count[trace[j]][trace[i]] = trace.size() - (j - i);
                }
            }
        }
    }

    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) {
            total_distance += jump_count[i][j];
        }
    }

    cout << total_distance << endl;
    return 0;
}

#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> count(ll k,vector<ll>& a) {
    vector<ll> prime;
    for (ll i=2;i<=sqrt(k);i++) 
    {
        if (k%i==0) 
        {
            prime.push_back(i);
            while (k%i==0) k/=i;    
        }
    }
    if (k>1)prime.push_back(k);
    vector<ll>counts(prime.size(),0);
    for (auto num:a) 
    {
        for (ll i=0;i<prime.size();i++) 
        {
            ll factor=prime[i];
            while (num%factor==0) 
            {
                counts[i]++;
                num/=factor;
            }
        }
    }
    return counts;
}
ll helper(vector<ll>a,ll k)
{
     vector<ll>factorCounts=count(k,a);
    return factorCounts.empty()?0:*min_element(factorCounts.begin(), factorCounts.end());
}
signed main() {
    ll n, k; cin>>n>>k;
    vector<ll>a(n);
    for(ll i=0;i<n;i++) cin>>a[i];
    cout<<min(n,helper(a,k));
    return 0;
}

#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a,ll b) { if (b==0) return a; return gcd(b,a%b); }
ll lcm(ll a,ll b) { return a/gcd(a,b)*b; }
ll solve(string s)
{
    ll n=s.size();
    vector<ll>c;
    for(ll i=0;i<n;i++)
        if(s[i]=='1') c.push_back(i+1);    
    ll ans=c[0];
    for(ll i=0;i<c.size();i++) ans=lcm(ans,c[i]);
    if(s=="01" or c.size()==0) return -1;
    return ans;    
    
}
signed main() 
{
    string s; cin>>s;
    cout<<solve(s);
    return 0;
}

#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll count(ll k,vector<ll>&a,vector<ll>&b)
{
    ll n=a.size();
    ll m=b.size();
    unordered_map<ll,ll>mpp;
    ll ans=0;
    for(ll i=0;i<n;i++) mpp[__gcd(a[i],k)]++;
    for(ll i=0;i<m;i++)
    {
        for (auto &it:mpp)
            if((__gcd(b[i],k)*it.first)%k==0) ans+=it.second;
    }
        return ans;
}
signed main() 
{
    ll n,m,k; cin>>n>>m>>k;
    vector<ll>a(n),b(m);
    for(ll i=0;i<n;i++) cin>>a[i];
    for(ll i=0;i<m;i++) cin>>b[i];
    cout<<count(k,a,b);
    return 0;
}