YELBRICK SPOJ

//Ad hoc
#include <bits/stdc++.h>

using namespace std;
int arr[1000][3];
int main() {
    int n;
    while((scanf("%d",&n))==1 && n)
    {
        int gcd;
        long long vol=0;
        int i;
        for(i=0;i<n;i++)
        {
            cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
        }
        gcd=arr[0][0];
        for(int i = 0;i <n;++i){
            gcd = __gcd(gcd,arr[i][0]);
            gcd = __gcd(gcd,arr[i][1]);
            gcd = __gcd(gcd,arr[i][2]);
        }
        for( i=0;i<n;i++)
        {
            vol+=(long long)((arr[i][0]/gcd)*(arr[i][1]/gcd)*(arr[i][2]/gcd));
        }
        cout<<vol<<endl;
    }
    // your code goes here
    return 0;
}