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

const int N = 1e6 + 10, mod = 998244353;

int n, fac[N], inv[N], ans, p[N], c[N];

bool vis[N];

int fpow_(int a, int b, int res = 1) {
    for (; b; b >>= 1, a = 1ll*a*a%mod) {
        if (b&1) {
            res = 1ll*res*a%mod;
        }
    }

    return res;
}

int main() {
    scanf("%d", &n);
    fac[0] = 1;
    
    for (int i = 1; i <= n; i++) {
        fac[i] = 1ll*fac[i - 1]*i%mod;
    }

    inv[n] = fpow_(fac[n], mod - 2);

    for (int i = n; i; i--) {
        inv[i - 1] = 1ll*inv[i]*i%mod;
    }

    for (int i = 1; i <= n; i++) {
        scanf("%d", &p[i]);
    }

    for (int i = 1; i <= n; i++) {
        if (vis[i]) {
            continue;
        }

        int cnt = 0;

        for (int j = i; !vis[j]; j = p[j]) {
            vis[j] = 1;
            cnt++;
        }

        c[cnt]++;
    }

    ans = fac[n];

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= c[i]; j++) {
            ans = 1ll*ans*inv[i]%mod*fac[i - 1]%mod;
        }

        ans = 1ll*ans*inv[c[i]]%mod;
    }

    printf("%d\n", (ans%mod + mod)%mod);
}