Reverse Birthday Problem: Minimum Calendar Size

Twenty-three people have birthdays chosen independently and uniformly from $\{1, 2, \ldots, d\}$. What is the smallest $d$ such that the probability of at least one shared birthday is strictly less than $\frac{1}{2}$?