#include<bits/stdc++.h>
#ifdef BIZON
    #define rr(...) [](const auto&...x){ char c='='; cerr << boolalpha << "\e[1;38;5;68m" << #__VA_ARGS__ << " "; ((cerr<<"\e[0;38;5;61m"<<exchange(c,',')<<"\e[0m "<<x),...); cerr<<endl; }(__VA_ARGS__);
#else
    #define rr(...) 0;
    #define endl '\n'
#endif
#define ALL(c) begin(c), end(c)
#define II(...) __VA_ARGS__; [](auto&...x){(cin>>...>>x);}(__VA_ARGS__);
#define ii(...) int II(__VA_ARGS__)
inline bool umin(auto&x, const auto&y){ return y<x ? x=y, 1 : 0; }
inline bool umax(auto&x, const auto&y){ return y>x ? x=y, 1 : 0; }
using namespace std;
using ll = long long;
using ld = long double;

ll f(int t, ll n) {
    ld m = (ld(100)+t) / 100;
    
    ll l = 1, r = 1e16;
    while(l<r) {
        ll d = (l+r) / 2;
        ll a = (t+100) * d / 100;
        
        assert(a>=d);
        if(a-d < n) l = d+1; else r = d;
    }
    
    
    ll ans = (t+100) * r / 100;
    
    return ans - 1;
}

int main(){
    if(auto f="in.txt"; fopen(f,"r") && freopen(f,"r",stdin));
    ios::sync_with_stdio(0);cin.tie(0);
    
    rr(f(3,1))
    rr(f(3,2))
    rr(f(3,3))
    rr(f(3,4))
    rr(f(3,5))
    
    ii(t,n)
    cout<<f(t,n)<<endl;
    
    
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)

template<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}init_;

#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif

const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
struct UnionFind {
private:
    vector<int> par;
    vector<int> count;
    vector<int> rank;
public:
    UnionFind(int N) {
        count.assign(N, 1);
        rank.assign(N, 0);
        par.assign(N, 0);
        rep(i, N) par[i] = i;
    }

    int root(int x) {
        if (par[x] == x)
            return x;
        else {
            par[x] = root(par[x]);
            return par[x];
        }
    }

    void unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return;
        if (rank[x] < rank[y])
            swap(x, y);
        else if (rank[x] == rank[y])
            rank[y]++;
        par[y] = x;
        count[x] += count[y];
        return;
    }

    int size(int x) {
        return count[root(x)];
    }

    bool issame(int x, int y) {
        return root(x) == root(y);
    }
};
using UF = struct UnionFind;

int main() {
    ll N;
    cin >> N;
    vl X(N), Y(N);
    rep(i, N) cin >> X[i] >> Y[i];

    using tp = tuple<ld, ll, ll>;
    vc<tp> P;

    rep(i, N) repe(j, i + 1, N) P.eb(hypotl(X[i] - X[j], Y[i] - Y[j]), i, j);
    rep(i, N) P.eb(100 - Y[i], i, N), P.eb(Y[i] + 100, i, N + 1);
    sort(all(P));

    UF uf(N + 2);
    for(auto[d, i, j]: P){
        uf.unite(i, j);
        if(uf.issame(N, N + 1)){
            cout << d / 2 << '\n';
            return 0;
        }
    }
}