int Gcd(int a, int b){
   return b==0?a:gcd(b, a%b);
}

#include "iostream"
#include "cstdio"
#include "cstring"
#include "string"
#include "algorithm"
using namespace std;

int Gcd(int a, int b)//毆幾里得算法，求最大公約數
{
    if(b==0) return a;
    else return Gcd(b, a%b);
}

int main()
{
    int x, y;
    while(cin>>x>>y)
    {
        cout<<Gcd(x, y)<<endl;
    }
}