KeyWords:GCD(greatest common divisor);

#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
int gcd(int a,int b){
    return a%b?gcd(b,a%b):b;
}
int main()
{
    int m , n;
    cin>>m>>n;
    
    cout<<"The Greatest common divisor of m and n is "<<gcd(m,n)<<endl;
    return 0;
}