import java.io.*; import java.util.*; import java.util.Map.Entry; @SuppressWarnings("unused") public class Main { //final boolean isDebug = true; final boolean isDebug = false; String fileName = "input.txt"; FastScanner sc; PrintWriter out; final int MOD = (int)1e9+7; //final int INF = Integer.MAX_VALUE / 2; final long INF = Long.MAX_VALUE / 2; void solve() throws Exception{ int N = sc.nextInt(); ArrayList> list = new ArrayList<>(); boolean[][] Q = new boolean[1<()); for(int j = 0; j < N; j++) list.get(num-1).add(Q[i][j]); } if(num == 1< Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }