#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define momen ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define ld long double
#define fp(n) for(int i=0;i<n;i++)
#define fp1(n) for(int i=1;i<=n;i++)
#define all(v) v.begin() , v.end()
const int mod = 1e9 + 7, N = 2e5 + 5, M = 8e6 + 5;
const ll LG = 20, inf = 1e9 + 6;


int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

int adj[N] , in[N];
ll ans[N] ;
ll answer = 1 ;
bool vis[N] ;

ll dfs(int i){
    if (vis[i])
        return 1;
    vis[i] = 1;
    ll ret = ans[i] ;
    ret*= dfs(adj[i]) ;
    ret%=mod ;
    return ret ;
}


void solve(int z) {
    int n;
    cin>>n ;

    for (int i = 1; i <= n ; ++i) {
        int x ;
        cin>>x ;
        adj[i] = x ;
        in[x]++;
    }
    queue<int>q ;
    for (int i = 1; i <= n ; ++i) {
        if (in[i] == 0)
            q.push(i) ;
        ans[i] = 1;
    }
    while (!q.empty()){
        int u = q.front() ;
        q.pop() ;
        in[adj[u]] -- ;
        ans[adj[u]] *= (ans[u]+1) ;
        ans[adj[u]]%=mod ;
        vis[u] = 1;
        if (in[adj[u]] == 0)
            q.push(adj[u]) ;
    }
    for (int i = 1; i <= n ; ++i) {
        if (!vis[i])
            answer *= (1 +dfs(i)) ;
        answer%=mod ;
    }
    cout<<answer-1<<endl;
}


int main() {
    momen
    int t = 1;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
//    cin >> t;

    for (int i = 1; i <= t; ++i) {
        //cout<<"Case #"<<i<<": ";
        solve(t);
    }

    return 0;
}