#include <cstdio>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <string>
#include <iostream>
using namespace std;

vector<int> V;
vector< queue<int> > neigh;
vector< queue<long double> > E;
vector<long double> P;

int f(int where, int from, int i)
{
	long double e;
	int k, r;
	while (!neigh[where].empty()){
		k = neigh[where].front();
		neigh[where].pop();
		e = E[where].front();
		E[where].pop();
		e += P[where];
		//cerr<<e<<' '<<P[k]<<' '<<k<<' '<<V[k]<<' '<<i<<endl;
		if (V[k] != 0){
			if (V[k] != i) continue;
			if (P[k] < e) return 1;
			else continue;
		}
		if (k == from) continue;
		P[k] = e;
		V[k] = i;
		r = f(k, where, i);
		if (r==1) return 1;
	}
	return 0;
}

int main()
{
	int C, R, i, A, B, l1, l2;
	map<string, int> M;

	char s[4], s2[4];
	while (1){
		scanf("%d", &C);
		if (C == 0) return 0;
		for (i=0; i<C; ++i){
			scanf("%s", s);
			M[s] = i;
		}
		neigh.resize(0);
		E.resize(0);
		P.resize(0);
		V.resize(0);
		neigh.resize(C);
		E.resize(C);
		P.resize(C);
		V.resize(C);

		scanf("%d", &R);
		for (i=0; i<R; ++i){
			scanf("%s %s %d:%d", s, s2, &A, &B);
			l1 = M[s];
			l2 = M[s2];
			neigh[l1].push(l2);
			E[l1].push((log((long double)B)) - log((long double)A));
		}

		for (i=0; i<C; ++i){
			if (V[i] == 0){
				V[i] = i+1;
				P[i] = 1;
				A = f(i, -1, i+1);
				//cerr<<'a'<<A<<endl;
				if (A==1){
					printf("Arbitrage\n");
					break;
				}
			}	
		}
		if (i<C) continue;
		else printf("Ok\n");
	}

	return 0;
}