#include<cstdio>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<bitset>
#include<stack>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>

using namespace std;

#define pb push_back
#define mp make_pair
#define sz(a) ((int)(a.size()))
#define all(a) a.begin(),a.end()
#define eps 1e-11
#define REP(i,n) for(int (i)=0;i<(n);++i)
#define REPS(i,n) for(int(i)=0;i<(n.size());++i)
#define FOR(i,a,b) for(int(i)=(a);i<=(b);++i)
#define FORD(i,a,b) for(int(i)=(a);i>=(b);--i)
#define FORE(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)

#define LL long long
#define SQR(a) ((a)*(a))
int N;
map<int,double> A[100];
char sval[100];
char nosuch[]="no such account";
char insuf[]="insufficient funds";
int main()
{
	while(scanf("%d",&N),N)
	{
		REP(i,100)A[i].clear();
		REP(i,N)
		{
			int x,b;double m;char ch;
			scanf("%d%c%d %lf",&x,&ch,&b,&m);
//			cout<<x<<" "<<b<<" "<<m<<endl;
			A[b][x]=m;
		}
	//	getchar();
		while(scanf("%s",sval),strlen(sval)!=3)
		{
			printf("%s",sval);
			if (strcmp(sval,"create")==0)
			{
				int x,b;char ch;
				scanf("%d%c%d",&x,&ch,&b);
				printf(": ");
				if (A[b].count(x)==0)A[b][x]=0,puts("ok");
				else puts("already exists");
			}
			if (strcmp(sval,"withdraw")==0)
			{
				int x,b;char ch;double m;
				scanf("%d%c%d %lf",&x,&ch,&b,&m);
				printf(" %.2lf: ",m);				
				if (A[b].count(x)==0)puts(nosuch);
				else if (A[b][x]<m-eps) puts(insuf);
				else A[b][x]-=m,puts("ok");				
			}
			if (strcmp(sval,"deposit")==0)
			{
				int x,b;char ch;double m;
				scanf("%d%c%d %lf",&x,&ch,&b,&m);
				printf(" %.2lf: ",m);
				if (A[b].count(x)==0)puts(nosuch);
				else A[b][x]+=m,puts("ok");
			}
			if (strcmp(sval,"transfer")==0)
			{
				int x,b,x2,b2;char ch;double m;
				scanf("%d%c%d %d%c%d %lf",&x,&ch,&b,&x2,&ch,&b2,&m);
				printf(" %.2lf: ",m);
				if (A[b].count(x)==0)puts(nosuch);
				else if (A[b2].count(x2)==0)puts(nosuch);
				else if (x==x2&&b==b2) puts("same account");
				else if (A[b][x]<m-eps) puts(insuf);
				else A[b2][x2]+=m,A[b][x]-=m,puts(b==b2?"ok":"interbank");								
			}
			//getchar();
		}
			puts("end");putchar(10);
	}
	puts("goodbye");
	return 0;
}