#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        int n, m;
        int ans = 0;
        scanf("%d%d", &n, &m);
        while (n > 0 && m > 0) {
            if (n < m) swap(n, m);
            n -= m;
            ans++;
        }
        printf("%d\n", ans);
    }
}