Assume we have a hash function that is perfectly random, and has a mediocre 40-bit output. How many different inputs will we need before we have a >0.01 probability of having a collision?

Assume we have a hash function that is perfectly random, and has a mediocre 40-bit output. How many different inputs will we need before we have a >0.01 probability of having a collision