#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N; cin >> N;
	int ans = INF;
	REP(i, N) {
		int a, p, x; cin >> a >> p >> x;
		x -= a;
		if (x > 0)chmin(ans, p);
	}
	if (ans == INF)ans = -1;
	cout << ans << endl;

	return 0;
}



#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>

using namespace std;


struct DataA {
    int a;
    char b;
};

template<typename T> void vMap(vector<T>& dst, vector<T>& src, function<T(T)> callback) {
    transform(src.begin(), src.end(), dst.begin(), callback);
}

int main() {
    int A, B, C, D;
    cin >> A >> B >> C >> D;

    if (B >= C * D) {
        cout << -1 << endl;
        return 0;
    }

    int i = 0;
    int diff = C * D - B;
    while (true) {
        i++;
        A -= diff;

        if (A <= 0) {
            cout << i << endl;
            break;
        }
    }
}
