There are n people, and given that any 2 of them have contacted with each other at most once. In any group of nā2 of them, any one person of the group has contacted with other people in this group for 3k times, where k is a non-negative integer. Determine all the possible value of n. combinatoricsgraph theory