diff --git a/xxubin04/README.md b/xxubin04/README.md
index b30d0f6..da43d60 100644
--- a/xxubin04/README.md
+++ b/xxubin04/README.md
@@ -58,4 +58,7 @@
 | 54차시 | 2024.07.11 |  Tree  | <a href="https://www.acmicpc.net/problem/1991">[1991]트리 순회 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/203 |
 | 55차시 | 2024.07.29 |  정렬  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/42747?language=python3">[Programmers]H-Index </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/208 |
 | 56차시 | 2024.08.05 |  구현  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/17677#">[2018 KAKAO BLIND]뉴스 클러스터링 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/211 |
-| 57차시 | 2024.08.08 |  Hash  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/42888">[2019 KAKAO BLIND]오픈채팅방 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/215 |
\ No newline at end of file
+| 57차시 | 2024.08.08 |  Hash  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/42888">[2019 KAKAO BLIND]오픈채팅방 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/215 |
+| 58차시 | 2024.09.04 |  DP  | <a href="https://www.acmicpc.net/problem/9095">[9095]1,2,3 더하기 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/219 |
+| 59차시 | 2024.09.08 |  BFS  | <a href="https://www.acmicpc.net/problem/21736">[21736]헌내기는 친구가 필요해 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/220 |
+| 60차시 | 2024.09.22 |  구현  | <a href="https://www.acmicpc.net/problem/1764">[1764]듣보잡 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/227 |
\ No newline at end of file
diff --git "a/xxubin04/\352\265\254\355\230\204/1764_\353\223\243\353\263\264\354\236\241.py" "b/xxubin04/\352\265\254\355\230\204/1764_\353\223\243\353\263\264\354\236\241.py"
new file mode 100644
index 0000000..30c0cb9
--- /dev/null
+++ "b/xxubin04/\352\265\254\355\230\204/1764_\353\223\243\353\263\264\354\236\241.py"
@@ -0,0 +1,18 @@
+input = open(0).readline
+
+N, M = map(int, input().split())
+never_listen = set()
+never_seen = set()
+
+for n in range(N):
+    never_listen.add(input().rstrip())
+
+for m in range(M):
+    never_seen.add(input().rstrip())
+
+never_listen_seen = sorted(list(never_listen & never_seen))
+
+print(len(never_listen_seen))
+
+for i in never_listen_seen:
+    print(i)
\ No newline at end of file