Counting on friends

At a party of $N$ people, there are some friendships. Prove that there are at-least two people with the same count of friends.

Assume that $N \ge 2$ and that the friendships are symmetric, i.e, if $A$ is friends with $B$, then $B$ is in turn friends with $A$.