Because of the birthday paradox, roughly how many tries does it take to find a collision on a hash function producing an n-bit digest?
n
