#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 1000'000'007, N = 300005;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return ((ll)x)*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; x=mul(x,x),y>>=1) if(y&1) res=mul(res,x); return res;}

const double eps = 1e-8, pi = acos(-1);
int sign(ll x) {return abs(x) <= eps ? 0 : (x > 0 ? 1 : -1);}
struct Pt {
  ll x, y, val;
  Pt (ll _x=0, ll _y=0) : x(_x), y(_y) {}
  Pt operator + (Pt o) {return Pt(x + o.x, y + o.y);}
  Pt operator - (Pt o) {return Pt(x - o.x, y - o.y);}
  Pt operator * (ll k) {return Pt(x * k, y * k);}
  Pt operator / (ll k) {return Pt (x / k, y / k);}
  ll operator * (Pt o) {return x * o.x + y * o.y;}
  ll operator ^ (const Pt& o) const {return x * o.y - y * o.x;}
};
int ori(Pt o, Pt a, Pt b) {return sign((o - a) ^ (o - b));}
struct Line {
  Pt a, b;
};
int pos(const Pt& a){return sign(a.y) == 0 ?  sign(a.x) < 0 : sign(a.y) < 0;}
bool cmp(const Pt& a, const Pt& b){return pos(a) == pos(b) ? sign(a ^ b) > 0 : pos(a) < pos(b);}

int n;
vector<Pt> a;

ll get_val(int x, int y){
    Pt tmp(x,y);
    auto it=lower_bound(all(a),tmp,cmp);
    if(it!=a.end()&&it->x==x&&it->y==y) return it->val;
    return 1e18;
}

int nxt(int i){return i+1==n?0:i+1;}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n; a.resize(n);
    for(int i=0; i<n; ++i){
        cin >> a[i].x >> a[i].y >> a[i].val;
        int g=__gcd(abs(a[i].x),abs(a[i].y));
        if(g>0) a[i].x/=g,a[i].y/=g;
    }
    sort(all(a),cmp);
    vector<Pt> b;
    for(int i=0; i<n; ++i){
        if(a[i].x==0&&a[i].y==0) continue;
        if(sz(b)&&b.back().x==a[i].x&&b.back().y==a[i].y) b.back().val=min(b.back().val,a[i].val);
        else b.pb(a[i]);
    }
    a=b;
    n=sz(a);
    ll res=1e18;
    for(int i=0; i<n; ++i) res=min(res,get_val(a[i].x,a[i].y)+get_val(-a[i].x,-a[i].y)+get_val(a[i].y,-a[i].x)+get_val(-a[i].y,a[i].x));
    ll minn=1e18,minid=-1;
    for(int i=0; i<n; ++i) if(a[i].val<minn) minn=a[i].val,minid=i;
    int pos1=minid,pos2=lower_bound(all(a),Pt(-a[minid].x,-a[minid].y),cmp)-a.begin();
    if(pos2==n) pos2=0;
    vector<Pt> vec1,vec2;
    vec1.pb(a[minid]);
    bool flag=0;
    for(int i=nxt(pos1); i!=pos1; i=nxt(i)){
        if(i==pos2) flag=1;
        if(flag) vec2.pb(a[i]);
        else vec1.pb(a[i]);
    }
    for(int _: {0,1}){
        if(vec1.empty()) break;
        if((vec1[0].x!=a[minid].x||vec1[0].y!=a[minid].y)&&(vec1[0].x!=-a[minid].x||vec1[0].y!=-a[minid].y)) break;
        int cur=0;
        ll minn=1e18;
        while(cur<sz(vec2)&&sign(vec1[0]^vec2[cur])==0) cur++;
        for(int i=1; i<sz(vec1); ++i){
            while(cur<sz(vec2)&&sign(vec1[i]^vec2[cur])>0) minn=min(minn,vec2[cur].val),cur++;
            res=min(res,vec1[0].val+vec1[i].val+minn);
        }
        swap(vec1,vec2);
    }
    cout << (res>1e17?-1:res) << "\n";
}