#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <array>
#include <stack>
#include <queue>
#include <chrono>
#include <numeric>
#include <memory.h>
#include <map>
#include <math.h>
#include <utility>
#include <set>

#pragma warning(disable:4996)
using namespace std;
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
typedef long long Int;
const double PI = 3.141592653589793238;
const Int INF = 999999999999;
typedef pair<int, int> P;


int main()
{
	string a;

	while (getline(cin, a), cin){
		vector<string> aa;

		auto left = a.begin();

		while (true){
			auto right = left;
			while (right != a.end() && *right != ' ')++right;

			aa.emplace_back(left, right);
			if (right == a.end())
				break;

			left = right + 1;
		}


		string c[3] = { "this", "that", "the" };

		vector<string> nn;
		vector<string> kk;
		for (auto x : aa){
			auto n = x.length();
			if (n == 3){
				kk.push_back(x);
			}
			if (n == 4){
				nn.push_back(x);
			}
		}

		for (auto x : kk){
			auto n1 = x[0] - c[2][0];
			bool f(true);

			for (int i = 1; i < 3; ++i){
				if (n1 != x[i] - c[2][i])
					f = false;
			}

			if (f){
				int i(0);
				for (auto x : aa){
					for (auto y : x){

						if ('a' > y || 'z' < y){
							std::cout << y;
							continue;
						}

						int q = y - 'a';
						if (q - n1 < 0){
							q = 26 - n1;
						}
						else
							q -= n1;

						std::cout << (char)(q + 'a');
					}
					if (i < aa.size() - 1)
						std::cout << " ";
					++i;
				}
				std::cout << endl;
				goto END;
			}
		}

		for (auto x : nn){
			auto n1 = x[0] - c[0][0];
			auto n2 = x[0] - c[1][0];
			bool f(true);
			bool f2(true);

			for (int i = 1; i < 4; ++i){
				if (n1 != x[i] - c[0][i])
					f = false;
				if (n2 != x[i] - c[1][i])
					f2 = false;
			}

			if (f){
				int i(0);
				for (auto x : aa){
					for (auto y : x){
						if ('a' > y || 'z' < y){
							std::cout << y;
							continue;
						}

						int q = y - 'a';
						if (q - n1 < 0){
							q = 26 - n1;
						}
						else
							q -= n1;

						std::cout << (char)(q + 'a');
					}
					if (i < aa.size() - 1)
						std::cout << " ";
					++i;
				}
				std::cout << endl;
				goto END;
			}
			else if (f2){
				int i(0);
				for (auto x : aa){
					for (auto y : x){
						if ('a' > y || 'z' < y){
							std::cout << y;
							continue;
						}

						int q = y - 'a';
						if (q - n2 < 0){
							q = 26 - n2;
						}
						else
							q -= n2;

						std::cout << (char)(q + 'a');
					}
					if (i < aa.size() - 1)
						std::cout << " ";
					++i;
				}
				std::cout << endl;
				goto END;
			}

		}
	END:;
	}
	return 0;
}