Subtask 1

Maintain a set of distinct names with a built-in data structure provided in your language (e.g., set<int> for C++).

For each type ~1~ query, output 1 if the set contains ~name~ or 0 if it does not.

For each type ~2~ query, insert ~name~ into the set.

Note that a dynamic array is insufficient since ~name~ could be at the end of the array for type ~1~ queries and blow up the solution to ~\mathcal{O}(Q^2)~.

Time Complexity: ~\mathcal{O}(Q \log N)~

Subtask 2

Instead of using one set, define an array of ~N~ sets.

The same logic as subtask ~1~ applies.

Time Complexity: ~\mathcal{O}(Q \log N)~