A subset of the integers $1, 2, \ldots, 100$ has the property that none of its members is 3 times another. What is the largest number of members such a subset can have?

Let's think step by step and output the final answer within \boxed{}.
user