#include <bits/stdc++.h>
using namespace std;
int find_par(int cn) {}
int gcd(int u, int v) {
  if (v == 0) return u;
  return gcd(v, u % v);
}
void insert_ind(int cs, int ci, int s, int e) {
  if (s == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ci <= mid)
    insert_ind(2 * cs, ci, s, mid);
  else
    insert_ind(2 * cs + 1, ci, mid + 1, e);
}
void update_ind(int cs, int ci, int s, int e, int val) {
  if (s == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ci <= mid)
    update_ind(2 * cs, ci, s, mid, val);
  else
    update_ind(2 * cs + 1, ci, mid + 1, e, val);
}
void update_seg(int cs, int ds, int de, int s, int e, int val) {
  if (ds == s && de == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ds <= mid) update_seg(2 * cs, ds, min(mid, de), s, mid, val);
  if (de > mid) update_seg(2 * cs + 1, max(mid + 1, ds), de, mid + 1, e, val);
}
void pattern_match(char pat[], const int len, int pi[]) {
  pi[0] = 0;
  for (int i = 1; i < len; i++) {
    int st = i - 1;
    while (st >= 0 && pat[pi[st]] != pat[i]) st = pi[st] - 1;
    if (st == -1)
      pi[i] = 0;
    else
      pi[i] = pi[st] + 1;
  }
}
void pattern_match(char pat[], int pi[], char tar[], const int len1, int gi[]) {
  if (pat[0] == tar[0]) gi[0] = 1;
  for (int i = 1; i < len1; i++) {
    int st = gi[i - 1];
    while (pat[st] != tar[i]) {
      if (st == 0) {
        st = -1;
        break;
      }
      st = pi[st - 1];
    }
    if (st == -1)
      gi[i] = 0;
    else
      gi[i] = st + 1;
  }
}
struct myArray {
  int mat[10][10];
};
myArray matrix_mul(myArray mat1, myArray mat2, const int sz) {
  int tmp[sz][sz];
  memset((tmp), 0, sizeof((tmp)));
  for (int r = 0; r < sz; r++)
    for (int c = 0; c < sz; c++)
      for (int cr = 0; cr < sz; cr++)
        tmp[r][c] += mat1.mat[r][cr] * mat2.mat[c][cr];
  myArray res;
  for (int r = 0; r < sz; r++)
    for (int c = 0; c < sz; c++) res.mat[r][c] = tmp[r][c];
  return res;
}
myArray unit_matrix(const int sz) {
  myArray ma;
  memset((ma.mat), 0, sizeof((ma.mat)));
  for (int i = 0; i < sz; i++) ma.mat[i][i] = 1;
  return ma;
}
myArray matrix_expo(int p, myArray mat, const int sz) {
  if (p == 0) {
    return unit_matrix(sz);
  }
  if (p & 1) return matrix_mul(mat, matrix_expo(p - 1, mat, sz), sz);
  myArray tmp = matrix_expo(p >> 1, mat, sz);
  return matrix_mul(tmp, tmp, sz);
}
const long double PI = acosl(-1.);
const double EPS = 1e-12;
int arr[100005], n, arr1[100005];
int main() {
  cin >> n;
  int sz = 0;
  for (int i = 0; i < n; i++) {
    int tp;
    cin >> tp;
    if (tp) {
      arr[sz] = arr1[sz++] = tp;
    }
    if (tp == 0 || i == n - 1) {
      if (sz == 0 && tp == 0) {
        cout << 0 << endl;
        sz = 0;
        continue;
      }
      sort(arr1, arr1 + sz);
      int act = 0;
      bool first = false, sec = false, thi = false;
      for (int j = 0; j < sz; j++) {
        if ((sz > 0 && arr[j] == arr1[sz - 1] && !first) ||
            (sz > 1 && arr[j] == arr1[sz - 2] && !sec) ||
            (sz > 2 && arr[j] == arr1[sz - 3] && !thi)) {
          if ((sz > 0 && arr[j] == arr1[sz - 1] && !first))
            first = true;
          else if ((sz > 1 && arr[j] == arr1[sz - 2] && !sec))
            sec = true;
          else if ((sz > 2 && arr[j] == arr1[sz - 3] && !thi))
            thi = true;
          if (act == 0) {
            cout << "pushStack\n";
            act++;
          } else if (act == 1) {
            cout << "pushFront\n";
            act++;
          } else if (act >= 2) {
            cout << "pushQueue\n";
            act++;
          }
        } else {
          if (act == 0) {
            cout << "pushStack\n";
          } else if (act == 1) {
            cout << "pushFront\n";
          } else if (act == 2) {
            cout << "pushBack\n";
          } else {
            cout << "pushQueue\n";
          }
        }
      }
      if (tp == 0) {
        if (sz > 3) sz = 3;
        cout << sz << " ";
        if (sz > 0) {
          cout << "popStack";
        }
        if (sz > 1) {
          cout << " popFront";
        }
        if (sz > 2) {
          cout << " popQueue";
        }
        cout << endl;
      }
      sz = 0;
    }
  }
  return 0;
}
