Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func incrementByte(b byte) byte {
	if b >= 97 && b < 122 {
		return b + 1
	} else if b == 122 {
		return 97
	}
	return b
}

func main() {
	scanner.Split(bufio.ScanLines)

	for {
		line := nextString()
		if len(line) == 0 {
			break
		}
		for i := 0; i <= 26; i++ {
			decoded := []byte{}
			for j := 0; j < len(line); j++ {
				decoded = append(decoded, incrementByte(line[j]))
			}
			line = string(decoded)
			if strings.Contains(line, "the") || strings.Contains(line, "this") || strings.Contains(line, "that") {
				fmt.Println(line)
				break
			}
		}
	}
}

C++: #include <iostream>
#include <string>
#include <vector>

void split(const std::string &s, const char *delims, std::vector<std::string> &v)
{
    std::string::size_type p = 0;
    while (true) {
        std::string::size_type sp = s.find_first_of(delims, p);
        if (sp == std::string::npos) break;
        v.push_back(std::string(s.substr(p, sp - p)));
        p = sp + 1;
    }
}

int search_number(const std::string &s)
{
    std::vector<std::string> v;
    split(s, " ,.", v);

    const char *key = "this";
    for (unsigned i = 0; i < v.size(); ++i) {
        if (v[i].size() == 4) {
            int n = v[i][0] - key[0];
            if (v[i][1] - key[1] == n && v[i][2] - key[2] == n && v[i][3] - key[3] == n) return n;
        }
    }
    return 0;
}

int main()
{
    std::string s;
    while (getline(std::cin, s)) {
        int n = search_number(s);
        for (unsigned i = 0; i < s.size(); ++i) {
            if (s[i] != ' ' && s[i] != ',' && s[i] != '.') {
                s[i] -= n;
                if (s[i] < 'a') s[i] += 26;
                if (s[i] > 'z') s[i] %= 26;
            }
        }
        std::cout << s << std::endl;
    }
}

C++: #include<iostream>
#include<string>
#include<string.h>
using namespace std;
int main()
{
	string s;
	getline(cin, s);
	while (true){
		for (int i = 0; i < s.size(); i++){
			if (s[i] == 'z'){
				s[i] = 'a';
			}
			else if (s[i]>='a'&&s[i] < 'z'){
				s[i]++;
			}
		}
		if (s.find("the") != -1)break;
		if (s.find("this") != -1)break;
		if (s.find("that") != -1)break;
	}
	cout << s << endl;
}

C++: /*0017 written by iPhone*/
#include <iostream>
#include <string>
#include <cstring>

using namespace std;

int main(){
    string s;
    while(getline(cin, s)){
        for(int i = 0; i < s.size(); i++) s[i]++;
        if(strstr(s.c_str(), "the") || strstr(s.c_str(), "this") || strstr(s.c_str(), "that") ){
            cout << s;
            return 0;
        }
    }
    return 0;
}

C++: #include<iostream>
#include<string>
#include<vector>
using namespace std;
char CaesarChar(char );
string CaesarString(string s);
vector<string> CaesarVector(vector<string> v);
vector<string> SolveCaesar(vector<string> v);
int main() {
  string s;
  while( getline(cin,s)) {  
    vector<string> array;
    int space=0;
    int next_space=0;    
    for(int i=0;i<(int)s.size();i++) {
      if(s[i]== ' '){
	next_space=i;
	string tmp="";
	for(int j=space;j<next_space;j++)
	  tmp+=s[j];
	space=next_space+1;
	array.push_back(tmp);
      }
    }
    string tmp="";
    for(int i=next_space+1;i<(int)s.size();i++) 
      tmp+=s[i];
    array.push_back(tmp);
    vector<string> answer=SolveCaesar(array);
    for(int i=0;i<(int)answer.size();i++)
      cout<<answer[i]<<" "; 
    cout<<endl;
  }
  return 0;
}
char CaesarChar(char c) {
  if(c=='z')
    return 'a';
  if(int('a')<=int(c) && int(c)<int('z'))
  return char(c+1);
  return c;
}
string CaesarString(string s) {
  string tmp="";
  for(int i=0;i<(int)s.size();i++)
    tmp+=CaesarChar(s[i]);
  return tmp;
}
vector<string> CaesarVector(vector<string> v) {
  vector<string> tmp;
  for(int i=0;i<(int)v.size();i++) 
    tmp.push_back(CaesarString(v[i]));
  return tmp;
}
vector<string> SolveCaesar(vector<string> v) {
  for(int i=0;i<(int)v.size();i++) {
    if(v[i]=="the" || v[i]=="this" || v[i]=="that")
      return v;
  } 
  return SolveCaesar(CaesarVector(v));
}

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

#define FOR(i,l,r) for(int i = (l);i < (r);i++)
#define ALL(x) (x).begin(),(x).end()
template<typename T> bool chmax(T& a,const T& b){return a < b ? (a = b,true) : false;}
template<typename T> bool chmin(T& a,const T& b){return b < a ? (a = b,true) : false;}
typedef long long ll;

int N;
const int M = 26;
string S;
vector<string> words{"the","this","that"};

int main()
{
	while(getline(cin,S),S != ""){
		N = S.size();
		FOR(i,0,M){
			bool ok = false;
			FOR(j,0,words.size()){
				ok |= S.find(words [j]) != string::npos;
			}
			if(ok){
				cout << S << endl;
				break;
			}
			FOR(j,0,N) if(S [j] >= 'a' && S [j] <= 'z'){
				S [j] = (S [j] + 1 - 'a') % M + 'a';
			}
		}
	}

	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;

bool find(string str, string candy) {
  candy += ' ';
  str += ' ';
  for (int i = 0; i < str.length(); ++i) {
    if (string::npos != str.find(candy, i)) {
      return true;
    }
  }
  return false;
}

int main() {
  string str;
  while(getline(cin, str)) {
  string candies[] = {"this", "the", "that"};
  for (int m = 0; m < 25; ++m) {
    for (int i = 0; i < str.length(); ++i) {
      if (str[i] == ' ') {
        continue;
      }
      if (str[i] == ',' || str[i] == '.') {
        str[i] = ' ';
        continue;
      }
      int char_id = static_cast<int>(str[i]) - 97;
      int shifted = static_cast<int>(char_id + 1);
      str[i] = static_cast<char>(shifted % 26 + 97);
    }
    for (int i = 0; i < sizeof(candies) / sizeof(candies[0]); ++i) {
      if (find(str, candies[i])) {
        cout << str << endl;
      }
    }
  }
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>

#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(x=from;x<to;x++)

using namespace std;


int main(void){

string inl;
vector<string> svs;
string ww[3] ={"the","this","that"};
	getline(cin,inl);
//	stringstream ss(inl);   
//	string elem;
//	while (ss >> elem)  svs.push_back(elem);

	rep(i,26){
		rep(j,inl.size()){
			if(inl[j] >= 'a' && inl[j] <= 'z') inl[j] += 1;
			if(inl[j] > 'z' ) inl[j] -= 26;
			
			}
		if(inl.find(ww[0]) != string::npos || inl.find(ww[1]) != string::npos
			|| inl.find(ww[2]) != string::npos )  cout << inl << endl;
//		 cout << i << "::" << inl << endl;

	}

	
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main(){

    string s;
    vector<string> v;

    bool match = false;

    while(cin >> s) {
        v.push_back(s);
    }

    for(int i = 0; i < 26; ++i) {
        for(int j = 0; j < v.size(); ++j) {
            for(int k = 0; k < v[j].size(); ++k) {
                if(v[j][k] >= 'a' && v[j][k] <= 'z') {
                    v[j][k] = (v[j][k] + 1) % 'a' % 26 + 'a';
                }
            }
            if(v[j] == "the" || v[j] == "this" || v[j] == "that"
                || v[j] == "the." || v[j] == "this." || v[j] == "that.") {
                match = true;
            }
        }
        if(match) {
            for(int j = 0; j < v.size(); ++j) {
                cout << v[j];
                if(j  < v.size() - 1) {
                    cout << ' ';
                }
            }
            cout << endl;
            break;
        }
    }


}