#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) (int) v.size()
#define pb emplace_back
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){cout << "\n";}
template<class T, class ... U>
void debug(T a, U ... b){
	cout << a << "  ", debug(b...);
}
template<class T> void pary(T l, T r){
	while(l != r) cout << *l << " ", l++;
	cout << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream& operator<<(ostream& o, pair<A, B> p){
	return o << '(' << p.ff << ',' << p.ss << ')';
}

using ld = long double;
using pdd = pair<ld, ld>;
const ld PI = acos(-1);
#define X ff
#define Y ss

ld sqr(ld v){
	return v * v;
}
ld dis2(pdd a, pdd b){
	ld dx = a.X - b.X, dy = a.Y - b.Y;
	return dx * dx + dy * dy;
}

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

	int n;
	cin >> n;

	vector<pll> radi;
	vector<pair<ll, pdd>> peri;

	for(int i = 0; i < n; i++){
		int r, t, p;
		cin >> r >> t >> p;

		radi.pb(pll(r, p));
		ld theta = (ld)t * PI / 1000 / 180;
		ld x = r * cos(theta);
		ld y = r * sin(theta);
		peri.pb(make_pair(p, pdd(x, y)));
	}

	sort(iter(radi));
	sort(iter(peri));

	ld ans = 1e87;
	for(int i = 0; i + 1 < SZ(radi); i++){
		if(radi[i].ss != radi[i + 1].ss) ans = min(ans, sqr(radi[i + 1].ff - radi[i].ff));
	}
	//debug("test", ans);

	auto dfs1 = [&](auto dfs, vector<pdd>& pts, int l, int r) -> void{
		if(l >= r) return;
		int mid = (l + r) / 2;
		ld mx = pts[mid].X;
		dfs(dfs, pts, l, mid);
		dfs(dfs, pts, mid + 1, r);

		//debug("test", l, r);
		//pary(pts.begin() + l, pts.begin() + r + 1);
		vector<pdd> tmp(r - l + 1);
		merge(pts.begin() + l, pts.begin() + mid + 1, pts.begin() + mid + 1, pts.begin() + r + 1, tmp.begin(), 
			[&](pdd a, pdd b){return a.Y < b.Y;});	
		for(int i = l; i <= r; i++) pts[i] = tmp[i - l];
		tmp.clear();
		for(int i = l; i <= r; i++){
			if(sqr(abs(pts[i].X - mx)) <= ans) tmp.pb(pts[i]);
		}
		//pary(iter(tmp));
		for(int i = 0; i < SZ(tmp); i++){
			for(int j = i + 1; j < SZ(tmp) && sqr(abs(tmp[i].Y - tmp[j].Y)) <= ans; j++){
			//for(int j = i + 1; j < SZ(tmp); j++){
				//debug("updans", pts[i], pts[j],i, j, dis2(pts[i], pts[j]));
				ans = min(ans, dis2(tmp[i], tmp[j]));
			}
		}
		//debug("ok", sqrt(ans));
	};

	for(int i = 0; i < SZ(peri); ){
		ll p = peri[i].ff;
		vector<pdd> pts;
		for(; i < SZ(peri) && peri[i].ff == p; i++) pts.pb(peri[i].ss);
		sort(iter(pts));
		//debug("owo");
		//pary(iter(pts));
		dfs1(dfs1, pts, 0, SZ(pts) - 1);
	}
	cout << fixed << setprecision(20) << sqrt(ans) << "\n";

}