//STATUS:C++_AC_868MS_2220KB

 #include <functional>

 #include <algorithm>

 #include <iostream>

 //#include <ext/rope>

 #include <fstream>

 #include <sstream>

 #include <iomanip>

 #include <numeric>

 #include <cstring>

 #include <cassert>

 #include <cstdio>

 #include <string>

 #include <vector>

 #include <bitset>

 #include <queue>

 #include <stack>

 #include <cmath>

 #include <ctime>

 #include <list>

 #include <set>

 //#include <map>

 using namespace std;

 //#pragma comment(linker,"/STACK:102400000,102400000")

 //using namespace __gnu_cxx;

 //define

 #define pii pair<int,int>

 #define mem(a,b) memset(a,b,sizeof(a))

 #define lson l,mid,rt<<1

 #define rson mid+1,r,rt<<1|1

 #define PI acos(-1.0)

 //typedef

 typedef long long LL;

 typedef unsigned long long ULL;

 //const

 const int N=;

 const int INF=0x3f3f3f3f;

 const int MOD=1e9+,STA=;

 //const LL LNF=1LL<<60;

 const double EPS=1e-;

 const double OO=1e15;

 const int dx[]={-,,,};

 const int dy[]={,,,-};

 const int day[]={,,,,,,,,,,,,};

 //Daily Use ...

 inline int sign(double x){return (x>EPS)-(x<-EPS);}

 template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}

 template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}

 template<class T> inline T lcm(T a,T b,T d){return a/d*b;}

 template<class T> inline T Min(T a,T b){return a<b?a:b;}

 template<class T> inline T Max(T a,T b){return a>b?a:b;}

 template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);}

 template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);}

 template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));}

 template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));}

 //End

 int num[N],temp[N];

 int n;

 int ans;

 void sort(int l,int r)

 {

     if(l==r)return;

     int i,j,k,mid=(l+r)>>;

     sort(l,mid);

     sort(mid+,r);

     for(i=k=l,j=mid+;i<=mid && j<=r;){

         if(num[i]<num[j]){

             ans=(ans+j-mid-)&;

             temp[k++]=num[i++];

         }

         else temp[k++]=num[j++];

     }

     while(i<=mid){

         ans=(ans+j-mid-)&;

         temp[k++]=num[i++];

     }

     while(j<=r)

         temp[k++]=num[j++];

     for(i=l;i<=r;i++)

         num[i]=temp[i];

 }

 int main()

 {

  //   freopen("in.txt","r",stdin);

     int i,j,ok;

     while(~scanf("%d",&n))

     {

         ok=ans=;

         for(i=;i<n;i++)

             scanf("%d",&num[i]);

         sort(,n-);

         ok=ans;

         ans=;

         for(i=;i<n;i++)

             scanf("%d",&num[i]);

         sort(,n-);

         ok^=ans;

         printf("%s\n",ok?"Impossible":"Possible");

     }

     return ;

 }