def binary_search():
    l, r = 0, N
    
    while l<=r:
        m = (l+r)//2
        
        if m*(m+1)<N:
            l = m+1
        else:
            r = m-1
    
    return r

N = int(input())
K = binary_search()
print(K+N//(K+1))