This problem is very easy. As my mood is not so good, I will not elaborate the statement unnecessarily. In this problem you will be given **N** sets. Each of them will contain some distinct integer numbers. You have to form a new set using some chosen sets from given sets in a way such that there is *no common element* among the chosen sets and the number of total elements in the newly formed set is the *maximum* possible.

This is a companion discussion topic for the original entry at https://toph.co/p/easy