#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<algorithm>

using namespace std;

#define PRINTF(args...) printf(args)
//#define PRINTF(args...) 

#define FOR(i,a,b) for(int i=(a); i<(int)(b); ++i)
#define FORD(i,a,b) for(int i=(a)-1; i>=(int)(b); --i)
#define FOREACH(i,C) for(__typeof(C.begin()) i=C.begin(); i!=C.end(); ++i)
#define MAXN 300
char wej[MAXN], ret[MAXN], sl[MAXN];
bool testcase() {
	scanf("%s", wej);
	if(wej[0] == 'e') return false;
	if(wej[0] == 't') {
		int r = 0, pt = 3;
		while(isdigit(wej[pt])) r = 10*r + (wej[pt]-'0'), ++pt;
		int n;
		scanf("%d", &n);
		int dl = 0;
		while(n != 0) {
			int x = n % r;
			if(x < 0) x += r;
			ret[dl++] = x;
			n = (n - x) / (-r);
		}
		for(int i = dl - 1; i >= 0; --i) printf("%c", ret[i] + '0');
		printf("\n");
	} else {
		int r = 0, pt = 5;
		while(isdigit(wej[pt])) r = 10*r + (wej[pt]-'0'), ++pt;
		scanf("%s", sl);
		int dl = strlen(sl), ret = 0, mn = 1;
		for(int i = dl - 1; i >= 0; --i) {
			ret += (sl[i]-'0') * mn;
			mn *= -r;
		}
		printf("%d\n", ret);
	}
	return true;
}

int main() {
	while(testcase());
	return 0;
}