Infinite Meet or no-meets

I am a bit perplexed by the following problem.

Suppose a set of aleph_0 many people are given. Show there is an
infinite subset of that set such that either all the people in the
subset have met one another or all the people in the subset have not
met one another.

How does one go about to prove the above problem? I would ask my
teachers, but none of my teachers at my high school would know...

.