HW4.15

 import java.util.Scanner;

 public class Solution
 {
     public static void main(String[] args)
     {
         Scanner input = new Scanner(System.in);

         System.out.print("Enter n1: ");
         int n1 = input.nextInt();
         System.out.print("Enter n2: ");
         int n2 = input.nextInt();

         input.close();

         int greatestCommonDivisor;
         if(n1 >= n2)
             greatestCommonDivisor = n2;
         else
             greatestCommonDivisor = n1;

         for(int i = greatestCommonDivisor; i >= 2; i--)
         {
             if(n1 % i == 0 && n2 % i == 0)
             {
                 greatestCommonDivisor = i;
                 break;
             }
         }

         System.out.println("The greatest common divisor is " + greatestCommonDivisor);
     }
 }