I run a book club with \(n\) people, not including myself. Every day, for \(365\) days, I invite three members in the club to review a book. What is the smallest positive integer \(n\) so that I can avoid ever having the exact same group of three members over all \(365\) days?
