in an $n$-resident town, oddtown, all of their clubs must satisfy the following properties: all clubs must have an odd number of members and amongst any two distinct clubs, there must be an even number of residents in common. the classical oddtown theorem states that any such town can have at most $n$ clubs. in this talk, we explore how the residents can have $n+1$ clubs of odd size and minimize the chance of the town catching them. that is, we'd like to minimize the number of pairs of clubs with an odd number of members in common. we will also explore a similar problem with eventown.