//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn = 1e4+5;
#define mst(a, b) memset(a, b, sizeof a)
int main()
{
	char arr[maxn];
	while(scanf("%s",arr)!=EOF)
	{
	int len = strlen(arr);
	for(int i=0;i<len;++i)
	{
		if('a'<=arr[i]&&arr[i]<='c')
			arr[i]='2';
		if('d'<=arr[i]&&arr[i]<='f')
			arr[i]='3';
		if('g'<=arr[i]&&arr[i]<='i')
			arr[i]='4';
		if('j'<=arr[i]&&arr[i]<='l')
			arr[i]='5';
		if('m'<=arr[i]&&arr[i]<='o')
			arr[i]='6';
		if('p'<=arr[i]&&arr[i]<='s')
			arr[i]='7';
		if('t'<=arr[i]&&arr[i]<='v')
			arr[i]='8';
		if('w'<=arr[i]&&arr[i]<='z')
			arr[i]='9';
		if('A'<=arr[i]&&arr[i]<='Y')
			arr[i]+=33;
		if(arr[i]=='Z') arr[i]='a';
	}
	printf("%s\n",arr);
	mst(arr,0);
	}
	return 0;	
}