SWEA 1233規則演算の検証

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;

public class Solution {
	static BufferedReader br;
	static BufferedWriter bw;
	static StringTokenizer st;

	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		bw = new BufferedWriter(new OutputStreamWriter(System.out));
		// 숫자 > (int) 48
		for (int tc = 1; tc <= 10; tc++) {
			int N = Integer.parseInt(br.readLine());
			int pass = 1;
			if (N % 2 == 0) {
				pass = 0;
				for (int i = 0; i < N; i++) {
					br.readLine();
				}
			} else {
				for (int i = 0; i < N / 2; i++) {
					st = new StringTokenizer(br.readLine(), " ");
					st.nextToken();
					if (st.nextToken().charAt(0) >= 48)
						pass = 0;
					if (st.nextToken().charAt(0) < 48)
						pass = 0;
					if (st.nextToken().charAt(0) < 48)
						pass = 0;
				}
				for (int i = N / 2; i < N; i++) {
					if (br.readLine().charAt(0) < 48)
						pass = 0;
				}
			}
			bw.append(String.format("#%d %d\n", tc, pass));
		}
		bw.flush();
		bw.close();
	}
}