#include <bits/stdc++.h>
using namespace std;
long long MOD_EXPO(long long b, long long p, long long m) {
  if (p == 0) return 1;
  long long ret = MOD_EXPO(b, p / 2, m) % m;
  ret = (ret * ret) % m;
  return ((p & 1) ? (ret * b) % m : ret % m);
}
long long POWER(long long N, long long K) {
  long long i, ans = 1;
  for (i = 1; i <= K; i++) ans *= N;
  return ans;
}
int SET(int N, int pos) { return (N | (1 << pos)); }
int RESET(int N, int pos) { return (N & !(1 << pos)); }
bool CHECK(int N, int pos) { return (N & (1 << pos)); }
int dx4[] = {1, -1, 0, 0};
int dy4[] = {0, 0, 1, -1};
int dx6[] = {0, 0, 1, -1, 0, 0};
int dy6[] = {1, -1, 0, 0, 0, 0};
int dz6[] = {0, 0, 0, 0, 1, -1};
int dx8[] = {1, -1, 0, 0, -1, 1, -1, 1};
int dy8[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dkx8[] = {-1, 1, -1, 1, -2, -2, 2, 2};
int dky8[] = {2, 2, -2, -2, 1, -1, 1, -1};
int tc = 1;
const double eps = 1e-9;
const double pi = acos(-1.0);
const long long int mx = 1e5;
const long long int mod = 1e9 + 7;
struct node {
  int val, idx;
  node(int v, int id) {
    val = v;
    idx = id;
  }
};
bool operator<(node A, node B) { return A.val > B.val; }
int a[mx + 5];
int main() {
  int i, j, k, n;
  while (cin >> n) {
    for (i = 1; i <= n; i++) scanf("%d", &a[i]);
    i = 1;
    while (i <= n) {
      vector<node> vn;
      j = i;
      while (i <= n && a[i]) {
        vn.push_back(node(a[i], i));
        i++;
      }
      sort(vn.begin(), vn.end());
      k = 0;
      while (j < i) {
        if (vn.size() > 0 && vn[0].idx == j) {
          k++;
          printf("pushStack");
        } else if (vn.size() > 1 && vn[1].idx == j) {
          k++;
          printf("pushQueue");
        } else if (vn.size() > 2 && vn[2].idx == j) {
          k++;
          printf("pushFront");
        } else {
          printf("pushBack");
        }
        printf("\n");
        j++;
      }
      if (i <= n) {
        printf("%d", k);
        for (j = 1; j <= k; j++) {
          if (j == 1) printf(" popStack");
          if (j == 2) printf(" popQueue");
          if (j == 3) printf(" popFront");
        }
        printf("\n");
        i++;
      }
    }
  }
  return 0;
}
