The Hardest Problem Ever (UVALive 2540, POJ 1298, HDU 1048, ZOJ 1392, SCU 1006, Regionals 2002 >> North America - South Central USA)

///     Raihan Ruhin
///     CSE, Jahangirnagar University.
///     Dhaka-Bangladesh.
///     id: raihanruhin (topcoder / codeforces / codechef / uva / uvalive / spoj), 3235 (lightoj)
///     mail: raihanruhin@ (yahoo / gmail / facebook)
///     blog: ruhinraihan.blogspot.com

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

#define SET(a) memset(a,-1,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define PI acos(-1.0)

#define MOD 1000000007
#define MX 100010


int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int tc, kk=1, n;
    string s;
    char ch;
    while(getline(cin, s) && s=="START")
    {
        while(getline(cin, s) && s!="END")
        {
            for(int i=0;i<s.size();i++)
                if(s[i]>='A' && s[i]<='Z')
                    if(s[i]>='F') s[i]=s[i]-5;
                    else s[i]=s[i]+21;
            cout<<s<<"\n";
        }
    }
return 0;
}