#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <string>
#include <algorithm>

std::map<std::string, int> IndexMap;
long double Array[400][400];

int main()
{
	int n, m, a, b;
	std::string buffer1, buffer2;
	char buf1[4], buf2[4];
	while(1)
	{
		memset(Array, 0, sizeof(Array));
		scanf("%d", &n);
		
		if(!(n))
		{
			return 0;
		}
		
		for(int i = 0; i < n; i++)
		{
			scanf("%s", buf1);
			buffer1 = buf1;
			IndexMap[buffer1] = i;
		}
		
		scanf("%d", &m);
		
		for(int i = 0; i < m; i++)
		{
			scanf("%s %s %d:%d", buf1, buf2, &a, &b);
			buffer1 = buf1;
			buffer2 = buf2;
			Array[IndexMap[buffer1]][IndexMap[buffer2]] = log(a) - log(b);
		}
		
		for(int k=0; k<n; k++)
		{
			for(int i=0; i<n; i++)
			{
				for(int j=0; j<n; j++)
				{
					Array[i][j] = std::min(Array[i][j], Array[i][k] + Array[k][j]);
				}
			}
		}
		
		int ok = 1;
		for(int k=0; k<n; k++)
		{
			if(Array[k][k] < 0)
			{
				ok = 0;
				break;
			}
		}
		if(ok)
			printf("Ok\n");
		else
			printf("Arbitrage\n");
	}
}