#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <chrono>
#include <set>

typedef long long llong;
const int MAXN = 10000 + 10;
const int INF  = 1e9;

int n, m;
int a[MAXN];
int b[MAXN];
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
std::vector <char> v[MAXN];

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        v[i].push_back('P');
        v[i].push_back('E');
        v[i].push_back('R');
        v[i].push_back('U');
        std::shuffle(v[i].begin(), v[i].end(), rng);
    }

    std::cout << 4 * n + 1 << '\n';
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 0 ; j < 3 ; ++j)
        {
            std::cout << i - 1 << " guess " << v[i][j] << '\n';
        }

        std::cout << i - 1 << " add " << v[i][3] << '\n';
    }

    std::cout << n << " end\n";
}

void input()
{
    std::cin >> n;
}

void fastIOI()
{
    freopen("peru.in", "r", stdin);
    freopen("peru.out", "w", stdout);
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}