10929

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
char nm(char C){
    if(C=='R')return 54;
    if(C=='M'||C=='N')return 53;
    if(C=='L')return 52;
    if(C=='D'||C=='T')return 51;
    if(C=='B'||C=='P'||C=='F'||C=='V')return 49;
    if(C=='C'||C=='G'||C=='J'||C=='K'||C=='Q'||C=='S'||C=='X'||C=='Z')return 50;
    return 0;
}
#define OK(C) (C!=65&&C!='E'&&C!='I'&&C!='O'&&C!='U'&&C!='Y'&&C!='W'&&C!='H')
char s[32],c,o[32];
int S,L,I;
int main(void){
    while(~scanf("%s",s+1)){
        S=0,L=strlen(s+1),CL(o,I=0);
        FT(1,L+1)if(OK(s[k])&&(!OK(s[k-1])||nm(s[k])!=nm(s[k-1])))o[I++]=nm(s[k]);
        printf("%s\n",o);
    }
    return 0;
}