/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#ifndef MAJK_LIB
#define MAJK_LIB

#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <bitset>
using namespace std;

#define x first
#define y second
constexpr int MOD = 1000000007;

typedef std::pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;


template<typename T, typename F> T foo(T t, T g, F f) {
	return t;
}


template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
auto fraclt = [](const pii&a,const pii&b) { return (ll)a.x * b.y < (ll)b.x * a.y; };
struct cmpfrac { bool operator()(const pii&a,const pii&b)const { return (ll)a.x * b.y < (ll)b.x * a.y; }};
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
int logceil(ll x) {int b=0;while(x){x>>=1;++b;}return b;}

namespace std {
    template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}};
}
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }

template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector<vector<T>>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector<vector<T>>>(a,vector<vector<T>>(b,vector<T>(c,t))){}};
template <typename T> struct bounded_priority_queue {
	inline bounded_priority_queue(ui X) : A(X), B(0) {}
	inline void push(ui L, T V) { B = max(B, L); A[L].push(V); }
	inline const T &top() const { return A[B].front(); }
	inline void pop() { A[B].pop(); while (B > 0 && A[B].empty()) --B; }
	inline bool empty() const { return A[B].empty(); }
	inline void clear() { B = 0; for (auto &a: A) a = queue<T>(); }
private:
	vector<queue<T>> A; ui B;
};


#endif
// #include "../l/mod.h"

class F {
public:
	int mex(vector<int> &V) {
		sort(V.begin(), V.end());
		if (V.empty()) return 0;
		int w = 0;
		for (int v: V) {
			if (v > w) return w;
			w = v+1;
		}
		return V.back() + 1;
	}

	void run(stack<int> &Q, vector<vector<int>> &U, vector<int> &C) {
		while (!Q.empty()) {
			int x = Q.top(); Q.pop();
			int val = mex(U[x]);
			A[x] = val;
			if (--C[P[x]] == 0) {
				Q.push(P[x]);
			}
			U[P[x]].push_back(val);
		}
	}

	int N;
	vector<int> A, P;
	vector<vector<int>> E;

    void solve(istream& cin, ostream& cout) {
		cin >> N;
		P.resize(N); A.resize(N);
		E.resize(N); E.clear();
		vector<int> C(N);
		for (int i = 0; i < N; ++i) {
			int p; cin >> p; --p;
			E[p].push_back(i);
			P[i] = p;
			C[p]++;
		}

		vector<vector<int>> U(N);
		stack<int> Q;
		for (int i = 0; i < N; ++i) {
			if (C[i] == 0) Q.push(i);
		}
		run(Q, U, C);
		int q = 0;
		while (C[q] == 0) ++q;
		int val = mex(U[q]);
		//cerr << "Using q " << q << ' ' << val << endl;

		auto CC = C;
		auto UU = U;
		CC[P[q]]--;
		UU[P[q]].push_back(val);
		Q = stack<int>(); Q.push(P[q]);
		run(Q, UU, CC);
		if (A[q] == val) {
		//	cerr << "A " << A;
			cout << "POSSIBLE\n" << endl;
			return;
		}

		auto UUU = U[q];
		UUU.push_back(val);
		val = mex(UUU);
		UU = U;
		CC = C;
		CC[P[q]]--;
		UU[P[q]].push_back(val);
		Q = stack<int>(); Q.push(P[q]);
		run(Q, UU, CC);
		if (A[q] == val) {
		//	cerr << "B " << A;
			cout << "POSSIBLE\n" << endl;
			return;
		}

		cout << "IMPOSSIBLE\n";
    }
};


int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	F solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}



Measured memory_bytes: 28544