#include <bits/stdc++.h>
int gcd(int x, int y) {
  int smaller, bigger, divisor, mod_num;
  int i;
  if (x < y) {
    smaller = x;
    bigger = y;
  } else {
    smaller = y;
    bigger = x;
  }
  mod_num = bigger % smaller;
  if (mod_num == 0) return smaller;
  for (i = 1; i < mod_num; i++) {
    if (smaller % i == 0 && mod_num % i == 0) divisor = i;
  }
  return divisor;
}
int main(void) {
  int x, y;
  scanf("%d", &x);
  scanf("%d", &y);
  printf("%d\n", gcd(x, y));
  return 0;
}
