Application of Chinese Remainder Theorem in a task

Question

Every second I get a remainder $r_i$ by division x $\in \{1, 2, ..., 100\}$ by $a_i$. All $a_i$ are unique, but $a_i$ can be equal to 1. How many pairs of $a_i$ and $r_i$ I need to guess x? This problem related to chinese remainder theorem, but I cannot figure it out.