import std.stdio, std.string, std.conv;
import std.array, std.algorithm, std.range;
import std.ascii;

string solve(string s)
{
    string[] WS = ["the","this","that"];
    immutable char N = 'z'-'a'+1;
    foreach(i;1..N)
    {
        string t = s.map!(c=>cast(immutable char)(isLower(c)?((c+i)-'a')%N+'a':c)).array();
        foreach(w_;t.split())
            foreach(w;w_.split("."))
                foreach(W;WS)
                    if(w==W)
                        return t;
    }
    return "not found";
}

void main()
{
    stdin.byLine().map!(to!string).map!solve().join("\n").writeln();
}