Let P_{1}, P_{2}, \ldots, P_{n} be points on the plane. There is an edge between distinct points P_{x}, P_{y} if and only if x \mid y. Find the largest n, such that the graph can be drawn with no crossing edges.
Let P_{1}, P_{2}, \ldots, P_{n} be points on the plane. There is an edge between distinct points P_{x}, P_{y} if and only if x \mid y. Find the largest n, such that the graph can be drawn with no crossing edges.