#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<deque>
#include<map>
#include<algorithm>
#include<cctype>
using namespace std;
deque<int> m;
map<string, int> x;
deque<pair<string, int>> r;
int main() {
	string a;
	while(cin >> a) {
		int i, j;
		for(i = 0; i < a.size(); i++) {
			if(a[i] >= 'A' && a[i] <= 'Z') {
				if(a[i] == 'Z')
					a[i] = 'a';
				else {
					a[i] += 1;
					a[i] = tolower(a[i]);
				}
			}
			else if(a[i] >= 'a' && a[i] <= 'z') {
				switch(a[i]) {
				case 'a':
				case 'b':
				case 'c':
					a[i] = '2';
					break;
				case 'd':
				case 'e':
				case 'f':
					a[i] = '3';
					break;
				case 'g':
				case 'h':
				case 'i':
					a[i] = '4';
					break;
				case 'j':
				case 'k':
				case 'l':
					a[i] = '5';
					break;
				case 'm':
				case 'n':
				case 'o':
					a[i] = '6';
					break;
				case 'p':
				case 'q':
				case 'r':
				case 's':
					a[i] = '7';
					break;
				case 't':
				case 'u':
				case 'v':
					a[i] = '8';
					break;
				case 'w':
				case 'x':
				case 'y':
				case 'z':
					a[i] = '9';
					break;
				}
			}
	}
		cout << a << endl;;
	}
	return 0;
}