1. Pay for an extra driver so the number between them is even and you can rotate them in shifts
2. Hire a bus or other large vehicle that can take 12 people instead of taking three cars
I realise there's a proper mathematical solution for this, but if people are going to make up a problem like this they need to make them genuinely difficult rather than place artificial limits on how you solve them.
There are 12 sockpuppets taking crypto enthusiast and investors for a ride. To make it fun, they rotate among themselves each time their ventures are declared scams. Only five suckpuppets feel comfortable driving the sheep, so how many ways can the sockpuppets, current and future scam sites, and sheep be arranged so that BitcoinTalk can remain solvent via ad revenue?
Is that grounded in reality enough for you?
Bump, so that new fellow monumental assholes can enjoy this year.