Find the length of the longest simple path in the divisor graph {1, 2, 3 . . 100}, where two vertices are connected by an edge if one divides another.

For example, the longest path for the divisor graph {1 . . 6} is length 6: 4, 2, 6, 3, 1, 5 is one such path.