/// fptu UWR
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int O = 1e5 + 5;
const int mod = 998244353;

int n, dem, d[O], p[O], dd[O], Max[O];

int exp(int a, int x){
    int res = 1;
    for (; x; x >>= 1, a = 1ll * a * a % mod) if (x & 1) res = 1ll * res * a % mod;
    return res;
}

void dfs(int u){
    dd[u] = 1;
    if (!dd[p[u]]) dfs(p[u]);
    dem += 1;
}

main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    if (fopen("input.in", "r")){
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }

    cin >> n;
    for (int i = 1; i <= n; ++ i){
        cin >> p[i];
    }

    vector<int> res;
    for (int i = 1; i <= n; ++ i){
        if (!dd[i]){
            dem = 0;
            dfs(i);
            if (dem > 1) res.push_back(dem - 1);
        }
    }

    d[1] = 1;
    for (int i = 2; i < O; ++ i){
        if (!d[i]){
            d[i] = i;
            for (int j = i * i; j < O; j += i) d[j] = i;
        }
    }

    for (int i : res){
        int x = i;
        while (x != 1){
            int z = d[x], cur = 0;
            while (x % z == 0){
                x /= z;
                cur += 1;
            }
            Max[z] = max(Max[z], cur);
        }
    }

    int ans = 1;
    for (int i = 2; i < O; ++ i){
        ans = 1ll * ans * exp(i, Max[i]) % mod;
    }

    for (int i : res) ans = (ans + (i == 1)) % mod;

    cout << ans;

}