The Chinese Remainder Theorem · Superchallenge problem

Find the smallest positive integer $N$ for which the congruence $x^2 \equiv 1 \pmod N$ has more than $100$ solutions $x$ with $0 \le x < N$.