Perfect Hash

#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 s[128];
int w[16],n,C,L;
int main(void){
    while(fgets(s,128,stdin)){
        CL(w,n=0),C=1<<30,L=strlen(s)-1;
        F(L)if(islower(s[i]))w[n]<<=5,w[n]+=s[i]-96;
            else if(s[i]^s[i+1])++n;
        F(n+1)C=min(C,w[i]);
        F(n+1)FT(i+1,n+1)if(C/w[i]%(n+1)==C/w[k]%(n+1))
            C=(w[i]<w[k]?(C/w[i]+1)*w[i]:(C/w[k]+1)*w[k]),i=k=0;
        printf("%s%d\n\n",s,C);
    }
    return 0;
}