There are 8 distinct points on a plane, where no three are collinear. An ant starts at one of the points, then walks in a straight line to each one of the other points, visiting each point exactly once and stopping at the final point. This creates a trail of 7 line segments. What is the maximum number of times the ant can cross its own path as it walks?

Let's think step by step and output the final answer within \boxed{}.
user