*/

	public int check2(int n) {
		if (tables[n] >= 0) {
			return tables[n];
		}
		boolean win = false;
		for (int i = n / 2; i >= 2; i--) {
			if (n % i == 0) {
				int tmp = check2(n - i);
				if (tmp == 0) {
					win = true;
					break;
				}
			}
		}
		if (win) {
			tables[n] = 1;
		} else {
			tables[n] = 0;
		}
		return tables[n];
	}