#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>

#define pb push_back
#define fst first
#define snd second

#define forn(i,n) forr(i,0,n)
#define forr(i,x,n) for(int i=(x); i<(n); i++)

using namespace std;

typedef unsigned long long ll;

const ll MAXN = 50005;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;

struct pt {
	int x, y, id;
};

inline bool cmp_x (const pt & a, const pt & b) {
	return a.x < b.x || a.x == b.x && a.y < b.y;
}

inline bool cmp_y (const pt & a, const pt & b) {
	return a.y < b.y;
}

pt a[MAXN];

double mindist;
int ansa, ansb;

inline void upd_ans (const pt & a, const pt & b) {
	double dist = sqrt ((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y) + .0);
	if (dist < mindist)
		mindist = dist,  ansa = a.id,  ansb = b.id;
}

void rec (int l, int r) {
	if (r - l <= 3) {
		for (int i=l; i<=r; ++i)
			for (int j=i+1; j<=r; ++j)
				upd_ans (a[i], a[j]);
		sort (a+l, a+r+1, &cmp_y);
		return;
	}

	int m = (l + r) >> 1;
	int midx = a[m].x;
	rec (l, m),  rec (m+1, r);
	static pt t[MAXN];
	merge (a+l, a+m+1, a+m+1, a+r+1, t, &cmp_y);
	copy (t, t+r-l+1, a+l);

	int tsz = 0;
	for (int i=l; i<=r; ++i)
		if (abs (a[i].x - midx) < mindist) {
			for (int j=tsz-1; j>=0 && a[i].y - t[j].y < mindist; --j)
				upd_ans (a[i], t[j]);
			t[tsz++] = a[i];
		}
}

int N;

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin >> N;
    forn(i,N){
        cin >> a[i].x >> a[i].y;
        a[i].id = i;
    }
    sort(a, a+N, &cmp_x);
    mindist = INF;
    rec(0,N-1);

    cout << min(ansa,ansb) << ' ' << max(ansa,ansb) << ' ' << fixed << setprecision(6) << mindist << endl;

    return 0;
}