
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
The Fibonacci sequence, also known as the golden section sequence or the Fibonacci sequence introduced by the mathematician Leonardo Fibonacci with the example of rabbit breeding, is a sequence as follows: 1, 1, 2, 3, 5, 8, 13, 21, 34, ... In mathematics, the Fibonacci sequence is defined by the following recursive formula: ${F_{1}}=1$, ${F_{2}}=1$, ${F_{n}}={F_{n-1}}+{F_{n-2}}$ $( n\geqslant 3 )$, then ${{F_{1}}+{F_{2}}+{F_{3}}+⋯+{F_{2016}}-{F_{2018}}=}$_______; $({{F_{2019}}-({F_{2}}+{F_{4}}+{F_{6}}+⋯+{F_{2018}})=}$_______.

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