#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;

#ifdef LOCAL
	#define eprintf(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
	#define eprintf(...) 42
#endif

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second

double startTime;
double getCurrentTime() {
	return ((double)clock() - startTime) / CLOCKS_PER_SEC;
}

const int N = 277;
int n;
char s[N];
vector<pii> a[N];

int main()
{
	startTime = (double)clock();
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);

	scanf("%d %s", &n, s);
//	n = 8;
//	for (int i = 0; i < (1 << n); i++)
//		s[i] = '1';
//	s[(1 << n) - 1] = '0';

	if (s[0] == '0') {
		printf("Impossible\n");
		return 0;
	}
	for (int i = 0; i < (1 << n); i++)
		for (int j = 0; j < (1 << n); j++) {
			if (s[i] == '0' && s[j] == '1' && ((i & j) == i)) {
				printf("Impossible\n");
				return 0;
			}
		}
	for (int i = 0; i < n; i++) {
		int mask = 1 << i;
		for (int j = 0; j <= i + 1; j++)
			a[mask].push_back(mp(j, 0));
		a[mask].push_back(mp(i + 1, 1));
		a[mask].push_back(mp(i, 1));
		for (int j = i; j >= 0; j--)
			a[mask].push_back(mp(j, 0));
	}
	for (int mask = 1; mask < (1 << n); mask++) {
		if (!a[mask].empty()) continue;
		int p = 0;
		while(((mask >> p) & 1) == 0) p++;
		p = 1 << p;
		int q = mask ^ p;
		a[mask].push_back(mp(0, 0));
		for (int i = 1; i < (int)a[p].size(); i++)
			a[mask].push_back(a[p][i]);
		for (int i = 1; i < (int)a[q].size(); i++)
			a[mask].push_back(a[q][i]);
		for (int i = (int)a[p].size() - 2; i >= 0; i--)
			a[mask].push_back(a[p][i]);
		for (int i = (int)a[q].size() - 2; i >= 0; i--)
			a[mask].push_back(a[q][i]);
	}
	vector<pii> ans;
	ans.push_back(mp(0, 0));
	for (int i = 0; i < (1 << n); i++) {
		if (s[i] == '1') continue;
		bool ok = true;
		for (int j = 0; j < i; j++) {
			if ((j & i) == j)
				ok &= s[j] == '1';
		}
		if (!ok) continue;
		for (int j = 1; j < (int)a[i].size(); j++)
			ans.push_back(a[i][j]);
	}
	printf("Possible\n");
	printf("%d\n", (int)ans.size() - 1);
	for (pii t : ans)
		printf("%d %d\n", t.first, t.second);

	return 0;
}
