#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    string s;
    cin >> s;
    string t = "abcdefghijklmnopqrstuvwxyz";
    for (int i = 0; i < 26; ++i) {
        if(s[i] != t[i]){
            cout << t[i] << "to" << s[i] << "\n";
        }
    }
    return 0;
}