Problem: Oh, no!

The coronavirus has caught you, and now you're sitting in a dark cellar, with tied legs (but not hands). You have a delicious cookie, a laptop in front of you, and your ideal development environment is open. The coronavirus convinces you to solve the following problem.

You are given two arrays A and B of size n. You can do operations of two types with array A: 

  * Reverse array A. That is the array [A_1,\ A_2,\ …,\ A_n] transformes into [A_n,\ A_{n-1},\ …,\ A_1]. 
  * Replace A with an array of its prefix sums. That is, the array [A_1,\ A_2,\ …,\ A_n] goes to [A_1,\ (A_1+A_2),\ …,\ (A_1+A_2+…+A_n)]. 



You need to understand if you can get an array B from the array A. If it is possible, you will have to restore the order of these operations by minimizing the number of operations of the second type. Fortunately, the coronavirus is good today, so he has allowed you not to restore actions if the minimum number of second type operations is more than 2⋅ 10^5. But coronavirus resents you, so if you restore the answer, the total number of operations should not exceed 5⋅ 10^5.

Solve this problem and get the cookie, or the coronavirus will extend the quarantine for five years and make the whole economy collapse! 

Input

The first line contains a single integer n (1≤ n ≤ 2⋅ 10^5).

The second line contains n integers A_1, A_2, …, A_n (1 ≤ A_i ≤ 10 ^ {12}).

The third line contains n integers B_1, B_2, …, B_n (1 ≤ B_i ≤ 10 ^ {12}).

Output

If you cannot get B from the A array, print "IMPOSSIBLE" (without quotes) on a single line.

If the minimum number of operations of the second type exceeds 2⋅ 10^5, print "BIG" (without quotes). In the second line print the number of operations of the second type, that needs to be applied to get array B from A.

Otherwise, in the first line print "SMALL" (without quotes). In the second line print the total number of operations of the first and second types m ≤ 5⋅ 10^5 (it is guaranteed that in this case there is such a sequence of actions). In the third line print a line of length m, consisting of characters 'R"and 'P' (without quotes).

The i-th character should be 'R', if the i-th action is of the first type, and should be 'P', otherwise.

If there are several such sequences, you can print any of them.

You can print each character in the uppercase or in the lowercase.

Examples

Input


2
5 7
5 7


Output


SMALL
0



Input


2
1 1
300000 1


Output


BIG
299999


Input


2
10 1
13 14


Output


SMALL
6
RPPPRP


Input


3
1 2 1
2 1 2


Output


IMPOSSIBLE

Note

In the first example, the arrays A and B already equal, so the number of required operations =0.

In the second example, we need to replace A with the prefix sums 299999 times and then reverse the array. Since 299999>2⋅ 10^5, there is no need to restore the answer.

In the fourth example, you cannot get B from the A.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int check(vector<long long> &v, vector<long long> &a) {
  int n = v.size();
  bool ok = 1;
  for (int i = 0; i < n; i++) ok &= (v[i] == a[i]);
  if (ok) return 0;
  long long mav = -1e12, maa = -1e12;
  long long miv = 1e12, mia = 1e12;
  for (int i = 0; i < n; i++) {
    mav = max(mav, v[i]);
    maa = max(maa, a[i]);
    miv = min(miv, v[i]);
    mia = min(mia, a[i]);
  }
  if (mav < maa || miv < mia) return -1;
  int d = 0;
  bool c3 = 0;
  for (int i = 1; i < n; i++) {
    d += (v[i] > v[i - 1]);
    c3 |= (v[i] == v[i - 1]);
  }
  if (c3) return 3;
  if (d == 0)
    return 2;
  else if (d == n - 1)
    return 1;
  return 3;
}
map<pair<long long, long long>, long long> cc;
vector<long long> k;
long long comb(long long n, long long m) {
  if (cc[pair<long long, long long>(n, m)])
    return cc[pair<long long, long long>(n, m)];
  long long res = 1;
  for (long long i = 1; i <= m; i++) {
    if (1e18 / res <= (n - i + 1)) {
      cc[pair<long long, long long>(n, m)] = -1;
      return -1;
    }
    res *= (n - i + 1);
    res /= i;
    if (res > 1e12) {
      cc[pair<long long, long long>(n, m)] = -1;
      return -1;
    }
  }
  cc[pair<long long, long long>(n, m)] = res;
  return res;
}
void solve(vector<long long> &v, long long x, vector<long long> &res) {
  long long n = v.size();
  res[0] = v[0];
  for (int i = 1; i < n; i++) {
    res[i] = v[i];
    for (int j = 0; j < i; j++) {
      long long c = comb(x - 1 + (i - j), i - j);
      if (c == -1) {
        res[i] = -1;
        break;
      }
      if (1e18 / c <= res[j]) {
        res[i] = -1;
        break;
      }
      res[i] -= (res[j] * c);
      if (res[i] <= 0) break;
    }
    if (res[i] <= 0) break;
  }
}
void answer(vector<pair<long long, long long> > &res) {
  long long c[2];
  c[0] = c[1] = 0;
  for (auto y : res) c[y.first] += y.second;
  if (c[1] > 2e5) {
    cout << ("BIG") << '\n';
    cout << (c[1]) << '\n';
  } else {
    reverse((res).begin(), (res).end());
    char cc[2];
    cc[0] = 'R';
    cc[1] = 'P';
    cout << ("SMALL") << '\n';
    cout << (c[0] + c[1]) << '\n';
    for (auto y : res)
      for (int i = 0; i < y.second; i++) cout << cc[y.first];
    cout << ("") << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  k.resize(n);
  vector<long long> a(n), b(n);
  long long maa = -1e12, mia = 1e12;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    maa = (a[i] > maa) ? a[i] : maa;
    mia = (a[i] < mia) ? a[i] : mia;
  }
  for (int i = 0; i < n; i++) cin >> b[i];
  if (n == 1) {
    if (a[0] == b[0]) {
      cout << ("SMALL") << '\n';
      cout << (0) << '\n';
      cout << ("") << '\n';
    } else
      cout << ("IMPOSSIBLE") << '\n';
    return 0;
  }
  queue<pair<vector<long long>, vector<pair<long long, long long> > > > qv;
  qv.push(pair<vector<long long>, vector<pair<long long, long long> > >(
      b, vector<pair<long long, long long> >(0)));
  vector<long long> v;
  vector<pair<long long, long long> > res;
  int cant = 0;
  while (!qv.empty()) {
    cant++;
    if (cant > 150)
      while (1)
        ;
    pair<vector<long long>, vector<pair<long long, long long> > > u =
        qv.front();
    qv.pop();
    v = u.first;
    res = u.second;
    int x = check(v, a);
    if (x == 0) {
      answer(res);
      return 0;
    } else if (x == 3) {
      reverse((v).begin(), (v).end());
      res.push_back(pair<long long, long long>(0, 1));
      x = check(v, a);
      if (x == 0)
        answer(res);
      else
        cout << ("IMPOSSIBLE") << '\n';
      return 0;
    }
    if (x == -1) {
      cout << ("IMPOSSIBLE") << '\n';
      return 0;
    }
    reverse((v).begin(), (v).end());
    res.push_back(pair<long long, long long>(0, 1));
    int xx = check(v, a);
    if (xx == 0) {
      answer(res);
      return 0;
    } else {
      reverse((v).begin(), (v).end());
      res.pop_back();
    }
    if (x == 2) {
      reverse((v).begin(), (v).end());
      res.push_back(pair<long long, long long>(0, 1));
      qv.push(pair<vector<long long>, vector<pair<long long, long long> > >(
          v, res));
    }
    if (x == 1) {
      if (n < 20) {
        long long ant = 0;
        for (long long po = (1ll << 40); po; po >>= 1) {
          solve(v, ant + po, k);
          long long mav = -1e12;
          for (int i = 0; i < n; i++) mav = max(mav, k[i]);
          if (check(k, a) == 1 && mav > maa) ant += po;
        }
        ant++;
        solve(v, ant, k);
        res.push_back(pair<long long, long long>(1, ant));
        qv.push(pair<vector<long long>, vector<pair<long long, long long> > >(
            k, res));
      } else {
        for (int i = 0; i < n; i++) k[i] = v[i];
        int ant = 0;
        while (1) {
          ant++;
          long long prefs = k[0];
          bool ok = 1;
          long long mav = k[0];
          for (int i = 1; i < n; i++) {
            k[i] -= prefs;
            prefs += k[i];
            ok &= (k[i] > k[i - 1]);
            mav = max(mav, k[i]);
          }
          if (!ok || mav <= maa) break;
        }
        res.push_back(pair<long long, long long>(1, ant));
        qv.push(pair<vector<long long>, vector<pair<long long, long long> > >(
            k, res));
      }
    }
  }
  return 0;
}