I run a coffee club with n people, not including myself. Every day, for 365 days, I invite four members in the club to have coffee with me. What is the smallest positive integer n so that I can avoid having the same group of four members over all 365 days?