#include <bits/stdc++.h>
#define ll long long
using namespace std;
// binary search
int main() {
long long n;
cin >> n;
ll l = 1, r =1e13, mid, ans;
while (l <= r) {
mid = r + (l - r)/2;
ll can = 314ll * mid + 4;
if (can >= n) {
ans = mid;
r = mid - 1;
}
else {
l = mid + 1;
}
}
cout << ans << endl;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgbGwgbG9uZyBsb25nCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgoKCi8vIGJpbmFyeSBzZWFyY2gKCmludCBtYWluKCkgewogICAgbG9uZyBsb25nIG47CiAgICBjaW4gPj4gbjsKCiAgICBsbCBsID0gMSwgciAgPTFlMTMsIG1pZCwgYW5zOwogICAgd2hpbGUgKGwgPD0gcikgewogICAgICAgIG1pZCA9IHIgKyAobCAtIHIpLzI7CgogICAgICAgIGxsIGNhbiAgPSAzMTRsbCAqIG1pZCArIDQ7CiAgICAgICAgaWYgKGNhbiA+PSBuKSB7CiAgICAgICAgICAgIGFucyA9IG1pZDsKICAgICAgICAgICAgciA9IG1pZCAtIDE7CiAgICAgICAgfQogICAgICAgIGVsc2UgewogICAgICAgICAgICBsID0gbWlkICsgMTsKICAgICAgICB9CgoKICAgIH0KICAgIGNvdXQgPDwgYW5zIDw8IGVuZGw7Cgp9