def gcd(a,b):
    if a<b:
        a,b = b,a
    if a%b == 0:
        return b
    else:
        return gcd(b,a%b)

m,n = map(int,input().split())
print("gcd="+str(gcd(m,n)))

#include<bits/stdc++.h>
using namespace std;
int gcd(int,int);
int main()
{
	int n,m;
	cin>>n>>m;
	cout<<"gcd="<<gcd(n,m);
}
int gcd(int a,int b)
{
	return b==0?a:gcd(b,a%b);
}