
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
Let $V$ be a set of 2019 points in space, where no four points are coplanar. Certain pairs of these points are connected by line segments, and let $E$ denote the set of these line segments. Find the smallest positive integer $n$ such that if $E$ contains at least $n$ elements, then $E$ must include 908 two-element subsets, each consisting of two line segments sharing a common endpoint, and no two subsets have any common elements.

Present the answer in LaTex format: \boxed{Your answer}
user