diff --git a/exam/packet.pdf b/exam/packet.pdf
index b0316b9..bc44ebb 100644
Binary files a/exam/packet.pdf and b/exam/packet.pdf differ
diff --git a/exam/packet.tex b/exam/packet.tex
index f5a198e..16b3ea4 100644
--- a/exam/packet.tex
+++ b/exam/packet.tex
@@ -6,7 +6,7 @@
 \usepackage{listings}
 \usepackage{xcolor}
 \usepackage{enumitem}
-
+\usepackage{comment}
 % Page layout
 \geometry{margin=1in}
 \pagestyle{fancy}
@@ -54,7 +54,7 @@
     \item For each problem, write a function or program according to the specified input/output format.
     \item Clearly comment your code if necessary.
 \end{enumerate}
-
+\begin{comment}
 % ========================= Problem 1 =========================
 \problem{Problem 1: Two Sum}
 \textit{Difficulty: Easy}
@@ -140,9 +140,9 @@ Output:
 8 10
 15 18
 \end{verbatim}
-
+\end{comment}
 % ========================= Problem 4 =========================
-\problem{Problem 4: Six Seven}
+\problem{Problem 6(.7): Six Seven}
 \textit{Difficulty: Easy}
 \begin{itemize}
 You are given a string S composed of only the characters ‘6', ‘7’, ‘A', ‘B', and ‘\#' (without the quotation marks). This string is processed from left to right, and you must maintain a sequence of chracters that changes according to these rules: