#include <bits/stdc++.h>
# define endl            '\n'
# define clr(x,a)        memset(x,a,sizeof(x))
# define vi              vector<int>
# define all(a)          a.begin(), a.end()
# define deb(x)          cout<<#x<<"=="<<x<<endl;
# define pb              push_back
# define sc              scanf
# define pr              printf
# define tc              int t; cin>>t; while(t--)
# define rev(s)          reverse(s.begin(),s.end())
# define linija          cout<<"___________\n";
# define sza(x)          (int)x.size()
using namespace std;
typedef long long ll;
const int mxN=100005, mxM=100005, LOG=18, koren=317, inf=1e8;
const ll mod=4294967295;
template<typename T> T nzd(T a, T b){if(b==0) return a;else return nzd(b, a%b);}
template<typename T> T nzs(T a, T b){return(a*(b/nzd(a,b)));}
template<typename T> T stepenuj(T e, T n){T x=1,p=e;while(n){if(n&1)x=(x*p)&mod;p=(p*p)&mod;n>>=1;}return x;}

int n, k;
int perm[1000][4];
int perm3[1000][3];
string res[1000006];

string slovo(int x){
   if(x == 0) return "P";
   if(x == 1) return "E";
   if(x == 2) return "R";
   if(x == 3) return "U";
}
string slovo2(){
   int r = rand()%4;
   return slovo(r);
}
string inttos(int x){
   if(x == 0) return "0";
   string ret = "";
   while(x){
      ret.pb((char)(x%10+'0'));
      x/=10;
   }
   reverse(all(ret));
   return ret;
}
int r;
void ispisi2(int i){
//   int r = rand()%24;
//   r = (r+1)%24;
   res[++k] = inttos(i) + " guess " + slovo(perm[r][0]);
   res[++k] = inttos(i) + " guess " + slovo(perm[r][1]);
   res[++k] = inttos(i) + " add " + slovo(perm[r][2]);
}
void ispisi3(int i){
//   r = (r+1)%24;
//   int r = rand()%24;
   res[++k] = inttos(i) + " guess " + slovo(perm[r][0]);
   res[++k] = inttos(i) + " guess " + slovo(perm[r][1]);
   res[++k] = inttos(i) + " guess " + slovo(perm[r][2]);
   res[++k] = inttos(i) + " add " + slovo(perm[r][3]);
}

int main(){
   srand(512);
   freopen("peru.in", "r", stdin);
   freopen("peru.out", "w", stdout);
   int P = 0;
   perm[P][0]=0; perm[P][1]=1; perm[P][2]=2; perm[P][3]=3;
   P++;perm[P][0]=0; perm[P][1]=1; perm[P][2]=3; perm[P][3]=2;
   P++;perm[P][0]=0; perm[P][1]=2; perm[P][2]=1; perm[P][3]=3;
   P++;perm[P][0]=0; perm[P][1]=2; perm[P][2]=3; perm[P][3]=1;
   P++;perm[P][0]=0; perm[P][1]=3; perm[P][2]=2; perm[P][3]=1;
   P++;perm[P][0]=0; perm[P][1]=3; perm[P][2]=1; perm[P][3]=2;

   P++;perm[P][0]=1; perm[P][1]=3; perm[P][2]=0; perm[P][3]=1;
   P++;perm[P][0]=1; perm[P][1]=3; perm[P][2]=3; perm[P][3]=0;
   P++;perm[P][0]=1; perm[P][1]=2; perm[P][2]=0; perm[P][3]=3;
   P++;perm[P][0]=1; perm[P][1]=2; perm[P][2]=3; perm[P][3]=0;
   P++;perm[P][0]=1; perm[P][1]=0; perm[P][2]=2; perm[P][3]=3;
   P++;perm[P][0]=1; perm[P][1]=0; perm[P][2]=3; perm[P][3]=2;

   P++;perm[P][0]=2; perm[P][1]=1; perm[P][2]=0; perm[P][3]=3;
   P++;perm[P][0]=2; perm[P][1]=1; perm[P][2]=3; perm[P][3]=0;
   P++;perm[P][0]=2; perm[P][1]=0; perm[P][2]=1; perm[P][3]=3;
   P++;perm[P][0]=2; perm[P][1]=0; perm[P][2]=3; perm[P][3]=1;
   P++;perm[P][0]=2; perm[P][1]=3; perm[P][2]=0; perm[P][3]=1;
   P++;perm[P][0]=2; perm[P][1]=3; perm[P][2]=1; perm[P][3]=0;

   P++;perm[P][0]=3; perm[P][1]=1; perm[P][2]=2; perm[P][3]=0;
   P++;perm[P][0]=3; perm[P][1]=1; perm[P][2]=0; perm[P][3]=2;
   P++;perm[P][0]=3; perm[P][1]=2; perm[P][2]=1; perm[P][3]=0;
   P++;perm[P][0]=3; perm[P][1]=2; perm[P][2]=0; perm[P][3]=1;
   P++;perm[P][0]=3; perm[P][1]=0; perm[P][2]=2; perm[P][3]=1;
   P++;perm[P][0]=3; perm[P][1]=0; perm[P][2]=1; perm[P][3]=2;


   cin >> n;
   r = rand()%24;
//   if(n > 8000) return 12;
   int j = 0, maxP = 24;

   for(int i = 0; i < n; i++){
      if(i >= 7000) ispisi2(i);
      else ispisi3(i);
//      j = (j+1)%maxP;
   }
   res[++k] = inttos(n)+" end";
   cout << k << endl;
   for(int i = 1; i <= k; i++) cout << res[i] << endl;

	return 0;
}