class FindPrime {
    public static boolean isPrimeIter(int n) {
        if (n <= 0) {
            return false;
        }

        for (int i = 2; i < n ; i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }

    public static boolean isPrimeRecur(int n) {
        System.out.println("Checking if " + n + " is a prime number");
        
        boolean prime = isPrimeHelper(n, 2);
        
        if (prime)
            System.out.println(n + " is a prime number");
        else
            System.out.println(n + " is not a prime number");
            
        return prime;
    }

    public static boolean isPrimeHelper(int n, int i) {
        if (n <= 0)
            return false;
        
        if (i >= n)
            return true;
        
        System.out.println("Checking divisable with " + i);
        if (n % i == 0)
            return false;

        return isPrimeHelper(n, i+1);
    }


    public static void main(String[] args) {
        System.out.println(isPrimeIter(7));
        System.out.println(isPrimeRecur(7));
    }
}