#include <bits/stdc++.h>                                           
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 2e5 + 12;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;

bool was[N];
int n, f;
vi g[N];
 
void add (int &x, int y) {
	x += y;
	if (x >= mod)
		x -= mod;
}

void dfs (int v) {
	was[v] = 1;
	for (auto to : g[v])
		if (!was[to])
			dfs(to);
}

main () {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> f;
		g[i].pb(f);
		g[f].pb(i);
	}

	int ans = 1;
	for (int i = 1; i <= n; ++i)
		if (!was[i]) {
			add(ans, ans);
			dfs(i);   
		}

	add(ans, -1);
	cout << ans << endl;
}
/*
  Author: EnderDeer
  Online Judge: Luogu
*/

#include<bits/stdc++.h>

#define int long long
#define mem(x) memset(x,0,sizeof(x))
#define mod 998244353

using namespace std;

int read(){
   int s = 0,w = 1;
   char ch = getchar();
   while(ch < '0' || ch > '9'){if(ch == '-')w = -1;ch = getchar();}
   while(ch >= '0' && ch <= '9')s = s * 10 + ch - '0',ch = getchar();
   return s * w;
}

int n;
int pre[1000010];
int siz[1000010];
int ans = 1; 

void init(){
	for(int i = 1;i <= n;i ++)pre[i] = i;
}

int find(int x){
	if(pre[x] == x)return x;
	else return pre[x] = find(pre[x]);
}

signed main(){
	cin>>n;
	init();
	for(int i = 1;i <= n;i ++){
		int x;
		x = read();
		pre[find(i)] = find(x);
	}
	for(int i = 1;i <= n;i ++)siz[find(i)] ++;
	for(int i = 1;i <= n;i ++){
		if(siz[i]){
			ans = (ans << 1) % mod;
		}
	}
	cout<<(ans + mod - 1) % mod;
	return 0;
}