#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
int n, dig[25];
ll dp1[25][2050];
ll dfs1(int i, int u, bool limit) {
	if (i==0) return 1;
	if (limit) {
		ll ans = 0;
		if (!u) ans+=dfs1(i-1, u, (dig[i]==0));
		else if (!(u&1)) ans+=dfs1(i-1, u|1, (dig[i]==0));
		for (int p=1;p<=dig[i];p++) {
			if (!((u>>p)&1)) ans+=dfs1(i-1, u|(1<<p), (p==dig[i]));
		}
		return ans;
	}
	else {
		if (dp1[i][u]!=-1) return dp1[i][u];
		ll ans = 0;
		if (!u) ans+=dfs1(i-1, u, 0);
		else if (!(u&1)) ans+=dfs1(i-1, u|1, 0);
		for (int p=1;p<=9;p++) {
			if (!((u>>p)&1)) ans+=dfs1(i-1, u|(1<<p), 0);
		}
		return dp1[i][u]=ans;
	}
}
__int128 dp2[20][70005];
__int128 dfs2(int i, int u, bool limit) {
	if (i==0) return 1;
	if (limit) {
		ll ans = 0;
		if (!u) ans+=dfs2(i-1, u, (dig[i]==0));
		else if (!(u&1)) ans+=dfs2(i-1, u|1, (dig[i]==0));
		for (int p=1;p<=dig[i];p++) {
			if (!((u>>p)&1)) ans+=dfs2(i-1, u|(1<<p), (p==dig[i]));
		}
		return ans;
	}
	else {
		if (dp2[i][u]!=-1) return dp2[i][u];
		ll ans = 0;
		if (!u) ans+=dfs2(i-1, u, 0);
		else if (!(u&1)) ans+=dfs2(i-1, u|1, 0);
		for (int p=1;p<=15;p++) {
			if (!((u>>p)&1)) ans+=dfs2(i-1, u|(1<<p), 0);
		}
		return dp2[i][u]=ans;
	}
}
__int128 read() {
	__int128 ans;
	char i;
	while (i=getchar(), !((i>='0'&&i<='9')||(i>='a'&&i<='f')));
	if (i>='0'&&i<='9') ans = i-'0';
	else ans = 10+i-'a';
	while (i=getchar(), (i>='0'&&i<='9')||(i>='a'&&i<='f')) {
		if (i>='0'&&i<='9') ans = ans*16+i-'0';
		else ans = ans*16+10+i-'a';
	}
	return ans;
}
void write(__int128 x) {
	if (x<16) {
		if (x<=9) putchar(x+'0');
		else putchar('a'+x-10);
		return ;
	}
	write(x/16);
	x%=16;
	if (x<=9) putchar(x+'0');
	else putchar('a'+x-10);
	return ;
}
int main() {
	memset(dp1, -1, sizeof(dp1));
	memset(dp2, -1, sizeof(dp2));
	scanf("%d", &n);
	for (int p=1;p<=n;p++) {
		char tp;
		cin>>tp;
		bool op;
		scanf("%d", &op);
		if (tp=='d') {
			if (!op) {
				ll l, r;
				scanf("%llu %llu", &l, &r);
				int tot = 0;
				while (r) {
					dig[++tot] = r%10;
					r/=10;
				}
				ll ans = dfs1(tot, 0, 1);
				if (l) {
					tot = 0;
					l--;
					while (l) {
						dig[++tot] = l%10;
						l/=10;
					}
					ans-=dfs1(tot, 0, 1);
				}
				printf("%llu\n", ans);
			}
			else {
				ll x;
				scanf("%llu", &x);
				ll l = 0, r = (1ll<<60);
				while (l<r) {
					ll mid = (l+r)/2;
					int tot = 0;
					ll t = mid;
					while (t) {
						dig[++tot] = t%10;
						t/=10;
					}
					if (dfs1(tot, 0, 1)>=x) r = mid;
					else l = mid+1;
				}
				if (r==(1ll<<60)) puts("-");
				else printf("%llu\n", l);
			}
		}
		else {
			if (!op) {
				__int128 l = read(), r = read();
				int tot = 0;
				while (r) {
					dig[++tot] = r%16;
					r/=16;
				}
				__int128 ans = dfs2(tot, 0, 1);
				if (l) {
					l--;
					tot = 0;
					while (l) {
						dig[++tot] = l%16;
						l/=16;
					}
					ans-=dfs2(tot, 0, 1);
				}
				write(ans);
				putchar('\n');
			}
			else {
				__int128 x = read();
				__int128 l = 0, r = (((__int128)(1))<<70);
				while (l<r) {
					__int128 mid = (l+r)/2;
					int tot = 0;
					__int128 t = mid;
					while (t) {
						dig[++tot] = t%16;
						t/=16;
					}
					if (dfs2(tot, 0, 1)>=x) r = mid;
					else l = mid+1;
				}
				if (r==(((__int128)(1))<<70)) puts("-");
				else {
					write(l);
					putchar('\n');
				}
			}
		}
	}
	return 0;
}