//
  // Created by ronal on 2/11/2023.
  // Problem Description Link.
  // https://practice.geeksforgeeks.org/problems/prime-number2314/1
  
  class Solution{
  public:
      int isPrime(int N){
          if(N <= 1){
              return 0;
          }else{
              for(int i = 2; i <= sqrt(N); i++){
                  if(N % i == 0){
                      return 0;
                  }
              }
          }
          return 1;
      }
  };