Prove longest path shares two points
If they only cross at a single vertex $v$, consider the distance from that $v$ to the four path ends. Since the lengths are odd, $v$ can not be in the exact middle of the paths. But then, are the paths really the longest ones?