From 2cb48be2a295c110cec5111a1b864dcad1809385 Mon Sep 17 00:00:00 2001
From: lkhyun <102892446+lkhyun@users.noreply.github.com>
Date: Sat, 4 Oct 2025 09:48:27 +0900
Subject: [PATCH] =?UTF-8?q?[20251004]=20BOJ=20/=20G4=20/=20=EC=A0=84?=
 =?UTF-8?q?=EA=B5=AC=EC=99=80=20=EC=8A=A4=EC=9C=84=EC=B9=98=20/=20?=
 =?UTF-8?q?=EC=9D=B4=EA=B0=95=ED=98=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0 \354\212\244\354\234\204\354\271\230.md" | 75 +++++++++++++++++++
 1 file changed, 75 insertions(+)
 create mode 100644 "lkhyun/202510/04 BOJ G4 \354\240\204\352\265\254\354\231\200 \354\212\244\354\234\204\354\271\230.md"

diff --git "a/lkhyun/202510/04 BOJ G4 \354\240\204\352\265\254\354\231\200 \354\212\244\354\234\204\354\271\230.md" "b/lkhyun/202510/04 BOJ G4 \354\240\204\352\265\254\354\231\200 \354\212\244\354\234\204\354\271\230.md"
new file mode 100644
index 00000000..88cc5232
--- /dev/null
+++ "b/lkhyun/202510/04 BOJ G4 \354\240\204\352\265\254\354\231\200 \354\212\244\354\234\204\354\271\230.md"	
@@ -0,0 +1,75 @@
+```java
+import java.util.*;
+import java.io.*;
+
+public class Main{
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    static StringTokenizer st;
+    static StringBuilder sb = new StringBuilder();
+    static int N;
+    static int[] input;
+    static int[] target;
+    static int cnt1 = 0;
+    static int cnt2 = 0;
+
+    public static void main(String[] args) throws Exception {
+        N = Integer.parseInt(br.readLine());
+        input = new int[N];
+        target = new int[N];
+
+        String temp1 = br.readLine();
+        String temp2 = br.readLine();
+        
+        for(int i = 0;i<N;i++){
+            input[i] = Character.getNumericValue(temp1.charAt(i));
+            target[i] = Character.getNumericValue(temp2.charAt(i));
+        }
+        int[] input1 = input.clone();
+        int[] input2 = input.clone();
+
+        for(int i = 1; i<N; i++){
+            if(input1[i-1] != target[i-1]){
+                input1[i-1] ^= 1;
+                input1[i] ^= 1;
+                if(i+1 < N) {
+                    input1[i + 1] ^= 1;
+                }
+                cnt1++;
+            }
+        }
+        for (int i = 0; i < N; i++) {
+            if(input1[i] != target[i]){
+                cnt1 = Integer.MAX_VALUE;
+                break;
+            }
+        }
+
+        input2[0] ^= 1;
+        input2[1] ^= 1;
+        cnt2++;
+        for (int i = 1; i < N; i++) {
+            if(input2[i-1] != target[i-1]){
+                input2[i-1] ^= 1;
+                input2[i] ^= 1;
+                if(i+1 < N) {
+                    input2[i + 1] ^= 1;
+                }
+                cnt2++;
+            }
+        }
+        for (int i = 0; i < N; i++) {
+            if(input2[i] != target[i]){
+                cnt2 = Integer.MAX_VALUE;
+                break;
+            }
+        }
+        int cnt = Math.min(cnt1, cnt2);
+        if(cnt == Integer.MAX_VALUE){
+            cnt = -1;
+        }
+        bw.write(cnt+"");
+        bw.close();
+    }
+}
+```