public static void main(String[] args) throws IOException {
		// BufferedReader in = new BufferedReader(new
		// InputStreamReader(System.in));
		Scanner scan = new Scanner(System.in);

		String line[];
		int times = 1;
		while (scan.hasNext()) {

			int n = scan.nextInt();// Integer.parseInt(line[0]);
			if(n==0)
				break;
			arr = new int[ n ];
			nCartas = n;
			dp = new int[ n ][ n ];
			dp2 = new int[ n ][ n ];
			long tm = System.currentTimeMillis();

			for (int i = 0; i < n; i++) {
				arr[i] = scan.nextInt();
			}
			for (int i = 0; i < n; i++) {
				for (int k = 0; k < n; k++) {

					dp[i][k] = Integer.MIN_VALUE;
					dp2[i][k] = Integer.MIN_VALUE;
				}

			}
			// System.out.println(System.currentTimeMillis() - tm);
			 bruteForce(0, 0, 0, 0, arr.length - 1, 0, "");
			 bruteForce(0, 0, 0, 0, arr.length - 1, 1, "");
			//dfs(0, 0, 0, 0, arr.length - 1, 1, "", "");
			//dfs2(0, 0, 0, 0, arr.length - 1, 0, "", "");
			
			for (int i = 0; i < n; i++) {
				if (dp[i][i] > max)
					max = dp[i][i];
				if (dp2[i][i] > max)
					max = dp2[i][i];
			}

			//System.out.println(camino);

			System.out.println("In game " + times + ", the greedy strategy might lose by as many as " + max + " points.");
			max = Integer.MIN_VALUE;
			times++;
			//System.out.println(System.currentTimeMillis() - tm);

			/*
			 * for (int i = 0; i < n; i++) { for (int k = 0; k < n; k++) { //
			 * System.out.print((dp[i][k] != Integer.MIN_VALUE ? dp[i][k] :
			 * "n   ")); } System.out.println(); }
			 */

		}
	}