103 teams scored 3120 points on this task, for a maximum score of 100, an average score of 30 and a median score of 10.
Rich Uncle Pennybags is getting tired of playing Monopoly, hence developed a new exciting number game. In this game, V tokens are randomly extracted, each depicting a distinct positive integer. Each player then has to select a subset S such that every pair (S_i, S_j) of elements in this subset satisfies: S_i % S_j = 0 or S_j % S_i = 0. The player who picks up the bigger subset wins! Rich Uncle Pennybags is not used to lose a game: help him find the largest allowed subset!