Question 46
In a group of $n$ tourists, among every three of them there are at least two that are not familiar. For any partition of the group into two groups, there are at least two familiar tourists in some of the groups. Prove that there is a tourist who is familiar with at most $\frac{2n}{5}$ tourists.