import math
N=int(raw_input())
M=N*(N-1)/2

upperBound = 2000001
isPrime=[True for i in range((upperBound-3)/2+1)]
for i in range((int(math.sqrt(upperBound-3))-3)/2+1): # k*k = (2i+3)^2 <= upperBound-3 
   if isPrime[i]:
      k = i+i+3 # this is prime number
      # false out non_prime number from k*k
      # k*k = 4i^2+12i+9 = 2*(2i^2+6i+3)+3
      # k*(k+1) = 2*(2i^2+6i+3)+3 + 2i+3 ... even number. skip
      # k*(k+2) = 2*(2i^2+6i+3+k)+3 
      non_prime = k*(i+1)+i
      for j in range(non_prime,(upperBound-3)/2+1,k):
         isPrime[j]=False
primes = [2] + [i+i+3 for i in range((upperBound-3)/2+1) if isPrime[i]==True]
#print len(primes)

ans=1
for p in primes:
    if min(N,M) <= 1:
        break
    tmp=1
    while N%p==0 and M%p ==0:
        tmp*=p
        tmp+=1
        N/=p
        M/=p
    ans*=tmp
if min(N,M) > 1:
    p=min(N,M)
    if N%p==0 and M%p == 0:
        ans *= p+1

print ans