#include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <deque>
#define ll long long
#define x first
#define y second
using namespace std;
bool fun(ll n,ll m){
ll t=n;
ll res=0;
while(t>0){
res+=min(t,m);
t-=min(t,m);
t-=(t/10);
}
if(2*res>=n) return true;
return false;
}
void binary(ll n){
ll l=1, r=n, m;
while(l<=r){
m=(r-l)/2+l;
if( fun(n,m) ) r=m;
else l=m+1;
}
cout<<m;
}
int main() {
ll n;
cin>>n;
binary(n);
return 0;
}
I2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGNsaW1pdHM+CiNpbmNsdWRlIDxpb3N0cmVhbT4KI2luY2x1ZGUgPHNldD4KI2luY2x1ZGUgPHF1ZXVlPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8ZGVxdWU+CgoKI2RlZmluZSBsbCBsb25nIGxvbmcKI2RlZmluZSB4IGZpcnN0CiNkZWZpbmUgeSBzZWNvbmQKCgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKCmJvb2wgZnVuKGxsIG4sbGwgbSl7CiAgICBsbCB0PW47CiAgICBsbCByZXM9MDsKICAgIHdoaWxlKHQ+MCl7CiAgICAgICAgcmVzKz1taW4odCxtKTsKICAgICAgICB0LT1taW4odCxtKTsKICAgICAgICB0LT0odC8xMCk7CiAgICB9CiAgICBpZigyKnJlcz49bikgcmV0dXJuIHRydWU7CiAgICByZXR1cm4gZmFsc2U7Cn0Kdm9pZCBiaW5hcnkobGwgbil7CiAgICBsbCBsPTEsIHI9biwgbTsKICAgIHdoaWxlKGw8PXIpewogICAgICAgIG09KHItbCkvMitsOwogICAgICAgIGlmKCBmdW4obixtKSApIHI9bTsKICAgICAgICBlbHNlIGw9bSsxOwogICAgfQogICAgY291dDw8bTsKfQoKaW50IG1haW4oKSB7CiAgICBsbCBuOwogICAgY2luPj5uOwogICAgYmluYXJ5KG4pOwogICAgcmV0dXJuIDA7Cn0=