Tower of Hanoi with Five Disks

Five disks of distinct sizes are stacked on the first of three pegs, largest at the bottom and smallest on top. You move disks one at a time from the top of any peg to the top of another peg, and a disk may never be placed on top of a smaller disk. What is the minimum number of single-disk moves needed to transfer the entire stack to the third peg?