#include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = 0; i < n; ++i)
#define rem(i, m, n) for (int i = m; i >= n; --i)
typedef long long ll;

int N;
ll X[1000], Y[1000];
ll D[1000][1000];

class UnionFind{
public:
  vector<int> uni;
  UnionFind(int s) : uni(s, -1) {}

  int root(int a){
    if(uni[a] < 0) return a;
    return uni[a] = root(uni[a]);
  }

  bool connect(int a, int b){
    a = root(a);
    b = root(b);
    if(a == b) return false;
    if(uni[a] > uni[b]) swap(a, b);
    uni[a] = uni[a] + uni[b];
    uni[b] = a;
    return true;
  }

  bool isConnect(int a, int b){
    return root(a) == root(b);
  }

  int size(int a){
    return -uni[root(a)];
  }
};

bool isOK(ll v) {
  UnionFind uf(1000);
  rep(i, 0, N) rep(j, 0, N) if(D[i][j] <= v * v * 100) uf.connect(i, j);
  return uf.isConnect(0, N - 1);
}

ll binary_search() {
  ll ng = 0;
  ll ok = 1e9;
  while(abs(ok - ng) > 1) {
    ll mid = (ok + ng) / 2;
    if(isOK(mid)) ok = mid;
    else ng = mid;
  }
  return 10 * ok;
}

ll getDist(ll x, ll y, ll x2, ll y2) {
  return (x-x2) * (x-x2) + (y-y2) * (y-y2);
}

ll solve() {
  cin >> N;
  rep(i, 0, N) cin >> X[i] >> Y[i];
  rep(i, 0, N) rep(j, 0, N) D[i][j] = getDist(X[i], Y[i], X[j], Y[j]);
  rep(i, 0, N) rep(j, 0, N) cout << i << " " << j << " " << D[i][j] << endl;
  return binary_search();
}

int main(){
  cout << solve() <<endl;
  return 0;
}