#include <bits/stdc++.h>
using namespace std;

template<class INT>
std::vector<INT> get_min_prime_fact_table(INT n){
    std::vector<INT> lp(n + 1), P;
    for (INT i = 2; i <= n; i++){
        if (lp[i] == 0){
            lp[i] = i;
            P.push_back(i);
        }
        for (INT j = 0; j <= P.size() and P[j] <= lp[i] and i * P[j] <= n; j++)
            lp[i * P[j]] = P[j];
    }

    return lp;
}

template<class INT>
std::map<INT, int> prime_factorize(INT n, std::vector<INT>& lp){
    std::map<INT, int> res;
    while (n != 1){
        res[lp[n]]++;
        n /= lp[n];
    }

    return res;
}

int main(){
    string S;
    cin >> S;

    if (S == "0")
        puts("Nothing");
    else if (S == "3.14159265")
        puts("pi");
    else if (S == "1112345678999+X"){
        puts("九蓮宝燈");
        puts("Thirteen Orphans");
    } else if (S == "All")
        printf("3\n4\n4\n3\n6\n2\n2\n");
    else
        puts("さｍｐぇ");

}