$3n$ ($n \ge 2, n \in N$) people attend a gathering, in which any two acquaintances have exactly $n$ common acquaintances, and any two unknown people have exactly $2n$ common acquaintances. If three people know each other, it is called a Taoyuan Group. (1) Find the number of all Taoyuan groups; (2) Prove that these $3n$ people can be divided into three groups, with $n$ people in each group, and the three people obtained by randomly selecting one person from each group constitute a Taoyuan group. Note: Acquaintance means that two people know each other, otherwise they are not acquaintances. Two people who know each other are called acquaintances.