#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const string w[] = { "the", "this", "that" };

string decoded_letter (string s, int m )
{
	int n = s.length();
	rep (i, n ){
		if (s[i] == ' ' || s[i] == ',' || s[i] == '.' ) continue;
		s[i] = (char)(((int)(s[i] - 'a') + m ) % 26 + 'a');
	} // end rep

	return s; 
}

bool is_include (string s )
{
	int n = s.length();
	rep (i, n ){
		if (s[i] == ',' || s[i] == '.' ) s[i] = ' ';
	} // end rep

	stringstream ss (s );
	string t = "";
	while (ss >> t ){
		rep (i, sizeof (w )/sizeof (w[0] ) ){
			if (t == w[i] ){
				return true;
			} // end if
		} // end rep
	} // end while

	return false;
}

int main()
{
//	cut here before submit 
//	freopen ("testcase.CC", "r", stdin );
	string str = "";
	while (getline (cin, str ) ){
		string decode = "";
		rep (i, 26 ){	// secret number
			decode = decoded_letter (str, i );
			if (is_include (decode ) ){
				break;
			} // end if
		} // end rep
		cout << decode << endl;		
	} // end loop
		
	return 0;
}