diff --git "a/Ukj0ng/202601/26 BOJ G4 \354\210\250\353\260\224\352\274\255\354\247\210 2.md" "b/Ukj0ng/202601/26 BOJ G4 \354\210\250\353\260\224\352\274\255\354\247\210 2.md"
new file mode 100644
index 00000000..ff779003
--- /dev/null
+++ "b/Ukj0ng/202601/26 BOJ G4 \354\210\250\353\260\224\352\274\255\354\247\210 2.md"	
@@ -0,0 +1,66 @@
+```
+import java.io.*;
+import java.util.ArrayDeque;
+import java.util.Arrays;
+import java.util.Queue;
+import java.util.StringTokenizer;
+
+public class Main {
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static final int[] dx = {1, -1, 2};
+    private static int[] visited;
+    private static int N, K;
+
+    public static void main(String[] args) throws IOException {
+        init();
+        int answer = BFS(N);
+
+        bw.write(visited[K] + "\n");
+        bw.write(answer + "\n");
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        K = Integer.parseInt(st.nextToken());
+
+        visited = new int[100001];
+        Arrays.fill(visited, Integer.MAX_VALUE);
+    }
+
+    private static int BFS(int start) {
+        Queue<int[]> q = new ArrayDeque<>();
+        int result = 0;
+        visited[start] = 0;
+        q.add(new int[] {start, visited[start]});
+
+        while (!q.isEmpty()) {
+            int[] current = q.poll();
+
+            if (current[1] > visited[current[0]]) continue;
+            if (current[0] == K && visited[current[0]] == current[1]) {
+                result++;
+            }
+
+            for (int i = 0; i < 3; i++) {
+                int nx = 0;
+                if (i == 2) {
+                    nx = current[0]*dx[i];
+                } else {
+                    nx = current[0]+dx[i];
+                }
+                if (nx < 0 || nx > 100000) continue;
+                if (visited[nx] < current[1]+1) continue;
+                visited[nx] = current[1]+1;
+                q.add(new int[] {nx, visited[nx]});
+            }
+        }
+
+        return result;
+    }
+}
+```