#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) x.size()
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define F first
#define S second
int n;
int f(int val)
{
int cnt = 0;
for (int i = 1; i <= n; ++i)
cnt += min(n, val / i);
return cnt;
}
void solve()
{
cin >> n;
int l = 0, h = n * n, target = n * n / 2 + 1;
int ans = h;
while (l <= h)
{
int mid = l + (h - l) / 2;
if (f(mid) >= target)
h = mid - 1, ans = mid;
else
l = mid + 1;
}
cout << ans;
}
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int tc = 1;
// cin >> tc;
while (tc--)
{
solve();
if (tc)
cout << '\n';
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGludCBsb25nIGxvbmcKI2RlZmluZSBzeih4KSB4LnNpemUoKQojZGVmaW5lIGFsbCh2KSB2LmJlZ2luKCksIHYuZW5kKCkKI2RlZmluZSBhbGxyKHYpIHYucmJlZ2luKCksIHYucmVuZCgpCiNkZWZpbmUgRiBmaXJzdAojZGVmaW5lIFMgc2Vjb25kCgppbnQgbjsKCmludCBmKGludCB2YWwpCnsKICAgIGludCBjbnQgPSAwOwogICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgKytpKQogICAgICAgIGNudCArPSBtaW4obiwgdmFsIC8gaSk7CiAgICByZXR1cm4gY250Owp9Cgp2b2lkIHNvbHZlKCkKewogICAgY2luID4+IG47CiAgICBpbnQgbCA9IDAsIGggPSBuICogbiwgdGFyZ2V0ID0gbiAqIG4gLyAyICsgMTsKICAgIGludCBhbnMgPSBoOwogICAgd2hpbGUgKGwgPD0gaCkKICAgIHsKICAgICAgICBpbnQgbWlkID0gbCArIChoIC0gbCkgLyAyOwogICAgICAgIGlmIChmKG1pZCkgPj0gdGFyZ2V0KQogICAgICAgICAgICBoID0gbWlkIC0gMSwgYW5zID0gbWlkOwogICAgICAgIGVsc2UKICAgICAgICAgICAgbCA9IG1pZCArIDE7CiAgICB9CiAgICBjb3V0IDw8IGFuczsKfQoKc2lnbmVkIG1haW4oKQp7CiAgICBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKDApLCBjaW4udGllKDApOwogICAgaW50IHRjID0gMTsKICAgIC8vIGNpbiA+PiB0YzsKICAgIHdoaWxlICh0Yy0tKQogICAgewogICAgICAgIHNvbHZlKCk7CiAgICAgICAgaWYgKHRjKQogICAgICAgICAgICBjb3V0IDw8ICdcbic7CiAgICB9CiAgICByZXR1cm4gMDsKfQ==