def gcd(a,b):
    if b > a:
        t = b
        b = a
        a = t
    if a % b == 0:
        return b
    else:
        return gcd(b, a % b)

n = int(raw_input())
if n == 1:
    print 1
else:
    print gcd(n, n*(n-1)/2)