#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<double> Complex;
const int INF = 1e9;
const ll LINF = 1e18;
const ll MOD = 998244353;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

int main() {
    string s;
    cin >> s;
    if (s[0] == '0') {
        cout << "Nothing" << endl;
    } else if (s[0] == '3') {
        cout << "pi" << endl;
    } else if (s[0] == '1') {
        cout << "九蓮宝燈" << endl << "Thirteen Orphans" << endl;
    } else if (s[0] == 'A') {
        cout << 3 << endl
             << 4 << endl
             << 4 << endl
             << 3 << endl
             << 6 << endl
             << 2 << endl
             << 2 << endl;
    } else {
        cout << "さｍｐぇ" << endl;
    }
}