#include <bits/stdc++.h>

const int N = 1e5;

int mod = 1e9 + 7;

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
template<class T>bool umin(T& a,const T& b){return b<a ? a=b,1:0;}
template<class T>bool umax(T& a,const T& b){return a<b ? a=b,1:0;}

int t[N], r[N]{}, vs[N];
bool usd[N]{};

int qpow(ll a, int b){
    ll rs = 1;
    while(b){
        if(a&1) rs *= a, rs %= mod;
        a *= a;
        a %= mod;
    }
    return rs;
}

ll dfs(int i, int st){
    usd[i] = 1;
    if(i == st) return vs[i];
    return vs[i] * dfs(t[i], st) % mod;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    for(int i = 0; i < n; ++i)
        vs[i] = 1;
    for(int i = 0; i < n; ++i)
        cin >> t[i], --t[i], ++r[t[i]];
    set<pair<int, int>> s;
    for(int i = 0; i < n; ++i)
        s.insert({r[i], i});
    while(!s.empty() and s.begin() -> first == 0){
        int v = s.begin() -> second;
        s.erase(s.begin());
        usd[v] = 1;
        s.erase({r[t[v]], t[v]});
        --r[t[v]];
        s.insert({r[t[v]], t[v]});
        int u = t[v];
        vs[u] *= vs[v] + 1;
        vs[u] %= mod;
    }
    ll rs = 1;
    for(int i = 0, u; i < n; ++i) if(!usd[i])
        u = dfs(t[i], i),
        rs *= u + 1, rs %= mod;
    cout << (rs - 1 + mod) % mod << endl;
}