Maximum Guaranteed Boyfriends in a Ratio Constraint

At a certain school, the ratio of boys to girls is $1:3$. Suppose that [label=\arabic*.] • Every boy has at most $2013$ distinct girlfriends. • Every girl has at least $n$ boyfriends. • Friendship is mutual. Compute the largest possible value of $n$.