Croutonillion has 2067 steps. Or some people can say 2068 because the last definition () is under the step 2067.

I will write saladder number. My goal is 3000 steps.

Start with a number three:

Let function C(n)

And C(1)=3

- C(X)
- Let function C(x,y):
- Also, C(0,x)=C(x)
- That means
- Calculation for number 3 is C(X,X)

- Let function :
- Also, C(0,anything)=C(anything)
- Calculation for number 4 is C(X,X,... (X times) ...,X)

- Repeat 1-4 X times
- Repeat 1-5 X times
- Keep going on until the sentence becomes "Repeat 1-X X times"
- Calculation for number 8 is "Set R" which is the following sentences:
- i. Repeat 1-n X times (n is the number of previous sentence)
- 2i. Repeat 1-n and i X times
- 3i. Repeat 1-n and i-2i X times
- And so on...
- (X+1)i. Repeat 1-n and i-Xi X times

- Repeat "Set R" X times
- Repeat "Set R" X^X times
- Repeat "Set R" X^X^X times
- Keep going on until X^X^... reaches to
- Calculation for number 13 is "Set RR" which is the following sentences:
- i. Repeat "Set R" X times
- 2i. Repeat "Set R" X^X times
- 3i. Repeat "Set R" X^X^X times
- And so on...
- Xi. Repeat "Set R" times

- Calculation for number 14 is "Set RRR" which is the following sentences:
- i. Repeat "Set RR" X times
- 2i. Repeat "Set RR" X^X times
- 3i. Repeat "Set RR" X^X^X times
- And so on...
- Xi. Repeat "Set RR" times

- Calculation for number 15 is "Set R^X" and R^k is the following sentences:
- i. Repeat "Set R^(k-1)" X times
- 2i. Repeat "Set R^(k-1)" X^X times
- 3i. Repeat "Set R^(k-1)" X^X^X times
- And so on...
- Xi. Repeat "Set R^(k-1)" times
- And definition for k=1 is written on number 8.

- Calculation for number 16 is "Set R^R" which is the following sentences:
- i. Repeat "Set R^1" X times
- 2i. Repeat "Set R^2" X^X times
- 3i. Repeat "Set R^3" X^X^X times
- And so on...
- Xi. Repeat "Set R^X" times

- Repeat "Set R^R" X times
- Repeat "Set R^R" X^X times
- Calculation for number 19 is "Set R^(R+X)" and R^(R+k) is the following sentences:
- i. Repeat "Set R^(R+k-1)" X times
- 2i. Repeat "Set R^(R+k-1)" X^X times
- 3i. Repeat "Set R^(R+k-1)" X^X^X times
- And so on...
- Xi. Repeat "Set R^(R+k-1)" times

- Calculation for number 20 is "Set R^2R", the rule is written on #21.
- It looks like ordinal. Yes, it is.

- Calculation for number 22 is "Set R^(XR)" and R^(kR) is the following sentences:
- i. Repeat "Set R^((k-1)R+1)" X times
- 2i. Repeat "Set R^((k-1)R+2)" X^X times
- 3i. Repeat "Set R^((k-1)R+3)" X^X^X times
- And so on...
- Xi. Repeat "Set R^((k-1)R+k)" times

- "Set R^R^2",which is equal to R^(XR)
- Repeat 1-22 X times
- Repeat 1-23 times
- Repeat 1-24 times
- "Set ", which R can be counted like ordinal omega.
- "Set "
- "Set "
- I will go chaos from now

- Repeat 1-30 X times
- Repeat 1-31 X^X times
- Keep going on until "Repeat 1-X N times" (N is polynomial of X that should follow this pattern)
- BEEF{X,X,... (X times) ...,X,X}
- Repeat 34 X times
- Repeat 35 X times
- Keep going on until "Repeat X X times"