#include <iostream>
#include <algorithm>
#define Int long long

using namespace std;

Int n, ans, m = 1e18;

struct P{
   Int r, k, y;
   Int weight(P a){
      return 3*(r-a.r)*(r-a.r)+2*abs((2*k-2*a.k)*(2*k+2*a.k))+5*abs(y-a.y);
   }
}p[10000];

int main() {
    cin >> n;
    for(int i = 0; i<n;++i){
       m = 1e18;
       cin >> p[i].r>>p[i].k>>p[i].y;
       for(int j = i-1; j>=0; --j)
            m = min(m,p[i].weight(p[j]));
       if(i) ans+=m;
    }
     cout << ans;
    return 0;
}