#include<bits/stdc++.h>

using namespace std;

const int N = ;

int n;

int c[N], p[N], l[N];

void ex_gcd(int a, int b, int &x, int &y)

{

    if(b == )

    {

        x = ;

        y = ;

    }

    else

    {

        ex_gcd(b, a % b, y, x);

        y -= x * (a / b);

    }

}

int main()

{

    scanf("%d", &n);

    int low = ;

    for(int i = ; i <= n; ++i)

    {

        scanf("%d%d%d", &c[i], &p[i], &l[i]);

        low = max(low, c[i]);

    }

    low = max(low, n);

    for(int m = low; m <= ; ++m)

    {

//        printf("m=%d\n", m);

        bool flag = true;

        for(int i = ; i <= n; ++i)

        {

            for(int j = i + ; j <= n; ++j)

            {

                int a, b, delta_v = ((p[i] - p[j]) % m + m) % m , delta_d = c[j] - c[i];

                if(delta_v < )

                {

                    delta_v *= -;

                    delta_d *= -;

                }

//                delta_d = (delta_d % m + m) % m;

                int t = __gcd(delta_v, m), tmp = m / t;

                if(delta_d % t != ) continue;

                ex_gcd(delta_v, m, a, b);

                a *= delta_d / t;

                a = (a % tmp + tmp) % tmp;

                if(a <= min(l[i], l[j]))

                {

                    flag = false;

                    break;

                }

            }

            if(!flag) break;

        }

        if(flag)

        {

            printf("%d\n", m);

            return ;

        }

    }

    return ;

}