From 71cfeb58a5f89c410a38fc794cc76a6607d1c963 Mon Sep 17 00:00:00 2001
From: oncsr <khj20006@naver.com>
Date: Tue, 11 Mar 2025 10:47:57 +0900
Subject: [PATCH] =?UTF-8?q?[20250311]=20BOJ=20/=20P3=20/=20=EC=B1=84?=
 =?UTF-8?q?=EC=84=9D=EC=9E=A5=20=EA=B2=8C=EC=9E=84=20/=20=EA=B6=8C?=
 =?UTF-8?q?=ED=98=81=EC=A4=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...5\354\236\245 \352\262\214\354\236\204.md" | 66 +++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 "khj20006/202503/11 BOJ P3 \354\261\204\354\204\235\354\236\245 \352\262\214\354\236\204.md"

diff --git "a/khj20006/202503/11 BOJ P3 \354\261\204\354\204\235\354\236\245 \352\262\214\354\236\204.md" "b/khj20006/202503/11 BOJ P3 \354\261\204\354\204\235\354\236\245 \352\262\214\354\236\204.md"
new file mode 100644
index 00000000..f68c1acf
--- /dev/null
+++ "b/khj20006/202503/11 BOJ P3 \354\261\204\354\204\235\354\236\245 \352\262\214\354\236\204.md"	
@@ -0,0 +1,66 @@
+```java
+
+import java.util.*;
+import java.io.*;
+
+
+class Main {
+	
+	// IO field
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+
+	static void nextLine() throws Exception {st = new StringTokenizer(br.readLine());}
+	static int nextInt() {return Integer.parseInt(st.nextToken());}
+	static long nextLong() {return Long.parseLong(st.nextToken());}
+	static void bwEnd() throws Exception {bw.flush();bw.close();}
+	
+	// Additional field
+
+	static int N;
+	static long[] X, M;
+	
+	static long f(long x) {
+		if(x%4 == 0) return x;
+		if(x%4 == 1) return 1;
+		if(x%4 == 2) return x+1;
+		return 0;
+	}
+	
+	public static void main(String[] args) throws Exception {
+			
+		ready();
+		solve();
+	
+		bwEnd();
+		
+	}
+	
+	static void ready() throws Exception{
+		
+		N = Integer.parseInt(br.readLine());
+		X = new long[N];
+		M = new long[N];
+		for(int i=0;i<N;i++) {
+			nextLine();
+			X[i] = nextLong();
+			M[i] = nextLong();
+		}
+		
+	}
+	
+	static void solve() throws Exception{
+		
+		long res = 0;
+		for(int i=0;i<N;i++) {
+			long x = X[i], m = M[i];
+			res ^= f(x-1) ^ f(x+m-1);
+		}
+		bw.write(res==0 ? "cubelover" : "koosaga");
+		
+	}
+	
+}
+
+```