The first nine prime numbers (2,3,5,7,11,13,17,19,23) are trying to get across a bridge. They only have one car, which they are each capable of driving, and which can hold a maximum of three of them. The time the car takes to cross the bridge is whatever the highest prime number in the car for that crossing, for instance if the 3, 7 and 17 are in the car it would take 17 minutes to cross.
What is the shortest time in which all the prime numbers can cross the bridge?