diff --git a/.gitignore b/.gitignore
index e257658..083209e 100644
--- a/.gitignore
+++ b/.gitignore
@@ -32,3 +32,4 @@
 *.out
 *.app
 
+program
diff --git a/Day2/Question1/input b/Day2/Question1/input
new file mode 100644
index 0000000..9352771
--- /dev/null
+++ b/Day2/Question1/input
@@ -0,0 +1 @@
+16100064-16192119,2117697596-2117933551,1-21,9999936269-10000072423,1770-2452,389429-427594,46633-66991,877764826-877930156,880869-991984,18943-26512,7216-9427,825-1162,581490-647864,2736-3909,39327886-39455605,430759-454012,1178-1741,219779-244138,77641-97923,1975994465-1976192503,3486612-3602532,277-378,418-690,74704280-74781349,3915-5717,665312-740273,69386294-69487574,2176846-2268755,26-45,372340114-372408052,7996502103-7996658803,7762107-7787125,48-64,4432420-4462711,130854-178173,87-115,244511-360206,69-86
diff --git a/Day2/Question1/inputTest b/Day2/Question1/inputTest
new file mode 100644
index 0000000..a3f22ef
--- /dev/null
+++ b/Day2/Question1/inputTest
@@ -0,0 +1 @@
+11-22,95-115,998-1012,1188511880-1188511890,222220-222224,1698522-1698528,446443-446449,38593856-38593862,565653-565659,824824821-824824827,2121212118-2121212124
diff --git a/Day2/Question1/main.cpp b/Day2/Question1/main.cpp
new file mode 100644
index 0000000..cfb32b1
--- /dev/null
+++ b/Day2/Question1/main.cpp
@@ -0,0 +1,40 @@
+#include <cmath>
+#include <cstdint>
+#include <fstream>
+#include <iostream>
+#include <string>
+
+int main() {
+  std::fstream file("input");
+  std::string currentID = "";
+  uint64_t rangeMin = 0, rangeMax = 0, positionOfHypen = 0,
+           sumOfAllInvalidIds = 0, numberOfDigits = 0;
+  double nthSymmetryicalNumber = 0;
+
+  while (std::getline(file, currentID, ',')) {
+    // I'm sure there is a better way to do this
+    positionOfHypen = currentID.find('-');
+    rangeMin = std::stoull(currentID.substr(0, positionOfHypen));
+    rangeMax = std::stoull(currentID.substr(positionOfHypen + 1));
+
+    for (uint64_t number = rangeMin; number <= rangeMax; number++) {
+      numberOfDigits = std::floor(std::log10(number)) + 1;
+
+      // Odd numbers can't satisfy the repeating pattern
+      if (numberOfDigits % 2 == 1) {
+        continue;
+      }
+
+      // Really only possible symmetry is here
+      nthSymmetryicalNumber =
+          number / static_cast<double>(std::pow(10, numberOfDigits >> 1) + 1);
+
+      // Checking if the number is "whole"
+      sumOfAllInvalidIds +=
+          nthSymmetryicalNumber == std::trunc(nthSymmetryicalNumber) ? number
+                                                                     : 0;
+    }
+  }
+  std::cout << sumOfAllInvalidIds << std::endl;
+  return 0;
+}