RU-SPB 2011 Problem 117

There is secret society with $2011$ members. Every member has bank account with integer balance ( can be negative). Sometimes some member give one dollar to every his friend. It is known, that after some such moves members can redistribute their money arbitrarily. Prove, that there are exactly $2010$ pairs of friends.