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

#include <iostream>
#include <fstream>

#include <bits/stdc++.h>

#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
#define mp make_pair

using namespace std;

typedef long long int64;
typedef vector<int> vi;
typedef pair<int, int> ii;

class TaskE {
 public:
  string inverse(string s) {
    string res = "";
    for (int i = s.size() - 1; i >= 0; --i) {
      char ch = s[i];
      if (ch >= 'a' && ch <= 'z') {
        ch += 'A' - 'a';
      } else {
        ch += 'a' - 'A';
      }
      res += ch;
    }
    return res;
  }

  void solveOne(istream &in, ostream &out) {
    int n;
    in >> n;
    string a;
    in >> a;
    vector<bool> tangled(1 << n);
    for (int i = 0; i < (1 << n); ++i) {
      tangled[i] = a[i] == '0';
    }
    if (tangled[0]) {
      out << "Impossible\n";
      return;
    }
    for (int s1 = 0; s1 < (1 << n); ++s1) {
      for (int s2 = 0; s2 < (1 << n); ++s2) {
        if ((s1 & s2) == s1 && !tangled[s2] && tangled[s1]) {
          out << "Impossible\n";
          return;
        }
      }
    }
    vector<ii> pts;
    pts.emplace_back(0, 0);
    for (int s1 = 0; s1 < (1 << n); ++s1) {
      if (tangled[s1]) {
        bool ok = true;
        for (int s2 = 0; s2 < (1 << n); ++s2) {
          if (s1 != s2 && ((s1 & s2) == s2) && tangled[s2]) {
            ok = false;
          }
        }
        if (!ok) continue;
        string seq = "";
        for (int i = 0; i < n; ++i) {
          if ((s1 & (1 << i)) != 0) {
            char ch = 'a' + i;
            if (seq.empty()) {
              seq += ch;
            } else {
              seq = ch + seq + (char) (ch + 'A' - 'a') + inverse(seq);
            }
          }
        }
        cerr << seq << endl;
        int x = 0;
        for (int p = 0; p < seq.size(); ++p) {
          char ch = seq[p];
          int i;
          int dir;
          if (ch >= 'A' && ch <= 'Z') {
            i = ch - 'A';
            dir = 0;
          } else {
            i = ch - 'a';
            dir = 1;
          }
          if (x < i) {
            for (int j = x + 1; j <= i; ++j) {
              pts.emplace_back(j, 0);
            }
          } else if (x > i) {
            for (int j = x - 1; j >= i; --j) {
              pts.emplace_back(j, 0);
            }
          }
          x = i;
          if (dir == 0) {
            pts.emplace_back(i + 1, 0);
            pts.emplace_back(i + 1, 1);
            pts.emplace_back(i, 1);
            pts.emplace_back(i, 0);
          } else {
            pts.emplace_back(i, 1);
            pts.emplace_back(i + 1, 1);
            pts.emplace_back(i + 1, 0);
            pts.emplace_back(i, 0);
          }
        }
        for (int j = x - 1; j >= 0; --j) {
          pts.emplace_back(j, 0);
        }
        x = 0;
      }
    }
    out << "Possible\n";
    out << pts.size() - 1 << "\n";
    for (const auto& p : pts) {
      out << p.first << " " << p.second << "\n";
    }
  }

  void solve(std::istream &in, std::ostream &out) {
    int nt;
    nt = 1;
    for (int it = 0; it < nt; ++it) {
      solveOne(in, out);
    }
  }
};


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


Measured memory_bytes: 640