
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
Changchun Carnival $G$ has 101 attractions, any two of which can always be connected by some walkways, and each walkway connects exactly two attractions. There is at most one walkway between any two attractions. If starting from a certain attraction, one can return to that attraction after traveling through a series of different walkways and different attractions, this series of walkways is called a "cycle," and the number of walkways in a cycle is defined as the "length" of the cycle. If every walkway in the carnival $G$ lies on a cycle of length at most $c(G)$, and the total number of walkways is $e(G)$, find the minimum possible value of $c(G)+e(G)$.

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