#include<bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld =long double;
//#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<int,pii> piii;
#define mp make_pair
long long gcd(long long a, long long b) {return b ? gcd(b, a % b) : a;}
long long lcm(long long m, long long n ){if((0 == m )||( 0 == n ))return 0;
return ((m / gcd(m, n)) * n);
}
int dp[41][4001][4001];
signed main(){
int n; cin>>n;
pii comp; cin>>comp.first>>comp.second;
rep(i,n)rep(j,4001)rep(k,4001)dp[i][j][k]=INF;
vector<pii>val;
vector<int>c(n);
rep(i,n){
pii temp; cin>>temp.first>>temp.second;
cin>>c[i];
val.push_back(temp);
dp[i][temp.first][temp.second]=c[i];
}
rep(i,n-1){
rep(j,4001){
rep(k,4001){
if(dp[i][j][k]==INF)continue;
cmin(dp[i+1][j][k],dp[i][j][k]);
int div=(int)gcd((ll)(i+val[i+1].first),(ll)(j+val[i+1].second));
pii ni=mp((i+val[i+1].first)/div,(j+val[i+1].second)/div);
cmin(dp[i+1][ni.first][ni.second],dp[i][j][k]+c[i+1]);
}
}
}
if(dp[n-1][comp.first][comp.second]==INF)return puts("-1")*0;
else cout<<dp[n-1][comp.first][comp.second]<<endl;
}