From 08be61bf9f58b998adbad71f83eeab883dde30e2 Mon Sep 17 00:00:00 2001
From: Youn-Rha <86452280+Youn-Rha@users.noreply.github.com>
Date: Sat, 19 Oct 2024 17:50:25 +0900
Subject: [PATCH] [Bronze V] Title: Call for Problems, Time: 32 ms, Memory:
 31120 KB -BaekjoonHub

---
 ...all\342\200\205for\342\200\205Problems.py" | 17 ++++++++++
 .../README.md"                                | 32 +++++++++++++++++++
 2 files changed, 49 insertions(+)
 create mode 100644 "\353\260\261\354\244\200/Bronze/32498.\342\200\205Call\342\200\205for\342\200\205Problems/Call\342\200\205for\342\200\205Problems.py"
 create mode 100644 "\353\260\261\354\244\200/Bronze/32498.\342\200\205Call\342\200\205for\342\200\205Problems/README.md"

diff --git "a/\353\260\261\354\244\200/Bronze/32498.\342\200\205Call\342\200\205for\342\200\205Problems/Call\342\200\205for\342\200\205Problems.py" "b/\353\260\261\354\244\200/Bronze/32498.\342\200\205Call\342\200\205for\342\200\205Problems/Call\342\200\205for\342\200\205Problems.py"
new file mode 100644
index 0000000..5d6a117
--- /dev/null
+++ "b/\353\260\261\354\244\200/Bronze/32498.\342\200\205Call\342\200\205for\342\200\205Problems/Call\342\200\205for\342\200\205Problems.py"
@@ -0,0 +1,17 @@
+import sys
+
+# sys.setrecursionlimit(100000)
+
+
+def input():
+    return sys.stdin.readline()
+
+
+# main
+if __name__ == "__main__":
+    N = int(input())
+    cnt = 0
+    for _ in range(N):
+        if int(input()) % 2 != 0:
+            cnt += 1
+    print(cnt)
diff --git "a/\353\260\261\354\244\200/Bronze/32498.\342\200\205Call\342\200\205for\342\200\205Problems/README.md" "b/\353\260\261\354\244\200/Bronze/32498.\342\200\205Call\342\200\205for\342\200\205Problems/README.md"
new file mode 100644
index 0000000..623189e
--- /dev/null
+++ "b/\353\260\261\354\244\200/Bronze/32498.\342\200\205Call\342\200\205for\342\200\205Problems/README.md"
@@ -0,0 +1,32 @@
+# [Bronze V] Call for Problems - 32498 
+
+[문제 링크](https://www.acmicpc.net/problem/32498) 
+
+### 성능 요약
+
+메모리: 31120 KB, 시간: 32 ms
+
+### 분류
+
+구현, 수학
+
+### 제출 일자
+
+2024년 10월 19일 17:50:18
+
+### 문제 설명
+
+<p>The Call for Problems for the ICPC North America Qualifier (NAQ) has finished, and a number of problems were proposed. The judges voted on the difficulty of each problem. The NAQ does not want to be considered an odd contest, so therefore they refuse to use any problem which has an odd number (not divisible by two) for a difficulty rating.</p>
+
+<p>Given the difficulty ratings of the candidate problems, how many were excluded by this rule?</p>
+
+### 입력 
+
+ <p>The first line of input contains a single integer $n$ ($1≤n≤50$), which is the number of candidate problems.</p>
+
+<p>Each of the next 𝑛n lines contains a single integer $d$ ($0≤d≤100$), which are the difficulty ratings of the $n$ problems.</p>
+
+### 출력 
+
+ <p>Output a single integer, which is the number of candidate problems excluded by the rule.</p>
+