package Recursion;

import java.util.Scanner;

public class demo {
	static int temp;
	public static void main(String[] args) {
		demo2(9,36);
	 }

	private static void demo2(int m,int n) {
		if (m > n) {
		 temp = m;
		} else {
		 temp = n;
		}
		if(m%temp==0 && n%temp==0){
			System.out.println(temp);
			return ;
		}
		if(temp==m){
			demo2(temp-1,n);
		}else{
			demo2(temp-1,m);
		}
		
	}

	private static void demo(int n,int m) {
		int temp;
		if (m > n) {
		 temp = n;
		} else {
		 temp = m;
		}
		for (int i = temp; i >= 1; i--) {
		 if (m % i == 0 && n % i == 0) {
		 System.out.println(i);
		 break;
		 }
		}
	}
	}