Prime Count Parity

We define \(\pi(n)\) as the number of primes less than or equal to \(n\). Given an integer \(n\), compute \(\pi(n) \bmod 2\).

inputFormat

The input consists of a single integer \(n\) (\(n \ge 1\)).

outputFormat

Print a single integer which is \(\pi(n) \bmod 2\).

sample

1

0