#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int n;
ll C(int a,int b)
{
printf("计算C %d %d\n",a,b);
ll res = 1;
for(int i=a,j=1;j<=b;i--,j++)
{
res = res * i / j;
if(res > n) return res;
}
return res;
}
bool check(int k)
{
ll l = 2*k, r = max(l,1ll*n);
while(l<r)
{
ll mid = l+r>>1;
if(C(mid,k) >= n) r=mid;
else l = mid+1;
}
if(C(l,k)!=n) return false;
printf("%lld",l*(l+1)/2+k+1);
return true;
}
int main()
{
cin>>n;
for(int k=16;k>=0;k--)
{
if(check(k))
break;
}
return 0;
}