a = input().split() n = int(a[0]) m = int(a[1]) b = [] for i in range(1,n): if n % i == 0 and m % i == 0: b.append(i) print(max(b))

#include<iostream> using namespace std; int main() { int n,m; cin>>n>>m; for(int i=n;i>=1;--i) { if(n%i0 and m%i0) { cout<<i<<endl; return 0; } } return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ int n,m; cin>>n>>m; int s=n; if(m>n){ s=m; } for(int i=m;i>=1;i--){ if(n%i0&&m%i0){ cout<<i; break; } } return 0; }

#include <bits/stdc++.h> using namespace std;int main(){int a,b;cin>>a>>b;cout<<__gcd(a,b);}

#include <bits/stdc++.h> using namespace std; int main(){ int a,b; cin >>a >>b; int c; c=max(a,b); while(1){ c--; if(a%c0&&b%c0){ cout <<c; break; } } return 0; }

n,m=input().split() n=int(n) m=int(m) a=1 for i in range(1,n+1):#遍历每一个数 if n%i0 and m%i0: a=i print(a)

#include<iostream> using namespace std; int main(){ int n,m; cin>>n>>m; int t=0; for(int i=1;i<=n;i++){ if(n%i0&&m%i0){ t=i; } } cout<<t; return 0; }

#include<bits/stdc++.h> using namespace std; int a,b; int main(){ cin>>a>>b; int c=min(a,b); for(int i=c;i>=1;i--){ if(a%i0 && b%i0){ cout<<i; return 0; } } }