#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
#include<set>
#include<bitset>
#include<math.h>
#include<map>
#include<queue>
#include<iomanip>
using namespace std;

int main(){
    string s;
    vector<string> scl{"A", "A#", "B", "C", "C#", "D", "D#", "E", "F", "F#", "G", "G#", "A"};
    cin >> s;
    auto i = find(scl.begin(), scl.end(), s);
    if (i == scl.end()) cout << "Not found" << endl;
    else cout << *(i+1) << endl; 
}