#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3
const int N=30;
const int mod=1e9+7;

int n,m;

int main(){
    int t;
    cin>>t;
    while (t--) {
        cin>>n>>m;
        if (n>m) {
            swap(n, m);
        }
        int sum=0;
        while (n<m) {
            m-=n;
            sum+=1;
            if (n>m) {
                swap(n, m);
            }
        }
        sum++;
        cout<<sum<<endl;
    }
    return 0;
}