diff --git a/debug2.cpp b/debug2.cpp
index 2572d52..6a10496 100644
--- a/debug2.cpp
+++ b/debug2.cpp
@@ -4,14 +4,14 @@ using namespace std;
 
 bool is_prime(int num) {
     if (num <= 1) {
-        return True;
+        return false;
     }
     for (int i = 2; i * i <= num; i++) {
         if (num % i == 0) {
-            return true;
+            return false;
         }
     }
-    return False;
+    return true;
 }
 
 int main() {
@@ -21,9 +21,8 @@ int main() {
     if (is_prime(input)) {
         cout << input << " is a prime number." << endl;
     } else {
-        cout << input << " is a prime number." << endl;
+        cout << input << " is not a prime number." << endl;
     }
-    cout << input << " is not a prime number." << endl;
     
     return 0;
 }
diff --git a/debug3.cpp b/debug3.cpp
index ff083c4..cf62343 100644
--- a/debug3.cpp
+++ b/debug3.cpp
@@ -5,10 +5,12 @@ using namespace std;
 
 int second_largest_number(vector<int>& nums) {
     int n = nums.size();
-    int largest = -1e5;
-    int second_largest = -1e5;
+    if(n==1)
+        return nums[0];
+    int largest = nums[0];
+    int second_largest = nums[0];
     for (int i = 0; i < n; i++) {
-        if (nums[i] > largest) {
+        if (nums[i] >= largest) {
             second_largest = largest;
             largest = nums[i];
         } else if (nums[i] > second_largest) {