1. def solve(n):
  2. 	if n <= 3:
  3. 		return 1 << n
  4. 	
  5. 	ans = 0
  6. 	L = n//3
  7. 	for mask in range(1 << L):
  8. 		ar = [1]*(n+1)
  9. 		for i in range(L):
  10. 			if ((mask >> i) & 1) == 0:
  11. 			    ar[i+1] = 0
  12. 			    continue
  13. 			for j in range(2*(i+1), L+1, i+1):
  14. 				if ((mask >> (j-1)) & 1) == 0:
  15. 					continue
  16. 				ar[j] = max(ar[j], ar[i+1] + 1)
  17. 		if max(ar) > 2:
  18. 			continue
  19. 		for i in range(1, L+1):
  20. 			if ar[i] == 2:
  21. 				for x in range(i, n+1, i):
  22. 					if x > L:
  23. 						ar[x] = -1
  24. 		for i in range(1, L+1):
  25. 			if ar[i] == 1:
  26. 				for x in range(i, n+1, i):
  27. 					if x > L and 2*x <= n and ar[x] != -1 and ar[2*x] != -1:
  28. 						ar[x] = 2
  29. 						ar[2*x] = 2
  30. 		one, two = 0, 0
  31. 		for i in range(L+1, n+1):
  32. 			one += ar[i] == 1
  33. 			two += ar[i] == 2
  34. 		ans += pow(2, one) * pow(3, two//2)
  35. 	return ans
  36.  
  37. n = int(input())
  38. print(solve(n))