#include <stdio.h>
#include <string.h>
#include <map>
#include <string>

#define NUM_CCIES	200

using namespace std;

struct Neighbours
{
	int count;
	int ccies[NUM_CCIES];
};

struct Rate
{
	long from, to;

	Rate operator *( const Rate &r) const
	{
		Rate ret;

		ret.from = from * r.from;
		ret.to = to * r.to;

		return ret;
	}
	
	bool operator != ( const Rate &r)const
	{
		return from * r.to != r.from * to;
	}
};


Neighbours neighbours[NUM_CCIES];
Rate rates[NUM_CCIES][NUM_CCIES];
Rate value[NUM_CCIES];

bool arbitrage_found(int from, int to)
{
//	printf("from: %d, value: %ld / %ld\n", from, value[from].from, value[from].to);
//	printf("to: %d, value: %ld / %ld\n", to, value[to].from, value[to].to);

	if (value[to].from > 0)
	{
		if ( value[from] * rates[from][to] != value[to] )
			return true;

		return false;
	}

	value[to] = value[from] * rates[from][to];

	Neighbours &neigh = neighbours[to];

	for ( int i=0; i<neigh.count; ++i)
	{
		int ccy = neigh.ccies[i];

		return arbitrage_found( to, ccy);
	}
	
	return false;
}

int main()
{
	int notfirst=0;

	for(;;)
	{
		int N;
		map<string,int> ccyind;

		scanf("%d", &N);

		if (N==0)
			break;

		for ( int i=0; i<N; ++i)
		{
			char ccy[4];
			scanf("%s",ccy);
			ccy[3]=0;
			ccyind.insert(make_pair(ccy,i));
		}

		scanf("%d", &N);

		memset(rates, 0, sizeof(rates));
		memset(neighbours, 0, sizeof(neighbours));

		for ( int i=0; i<N; ++i)
		{
			char ccy1[4], ccy2[4];
			int val1, val2;
			
			scanf("%s %s %d:%d",ccy1, ccy2, &val1, &val2);
			ccy1[3]=0; ccy2[3]=0;

			int ind1=ccyind.find(ccy1)->second;
			int ind2=ccyind.find(ccy2)->second;

			rates[ind1][ind2].from=val1;
			rates[ind1][ind2].to=val2;

			Neighbours &neigh1 = neighbours[ind1];

			neigh1.ccies[neigh1.count++]=ind2;
		}

		if (notfirst)
			printf("\n");
		notfirst=1;

		memset(value,0,sizeof(value));

		value[0].from=value[0].to=1;

		Neighbours &neigh = neighbours[0];
		int i;

		for ( i=0; i<neigh.count; ++i)
		{
			int ccy = neigh.ccies[i];

			if (arbitrage_found( 0, ccy))
				break;
		}

		if ( i<neigh.count)
			printf("Arbitrage");
		else
			printf("Ok");
	}
	return 0;
}