Xiaoya has 10 identical candies in total, and he can eat 1 or 2 candies each time until he runs out. How many different combinations does he have to eat up all these candies?
小亚共有10颗完全相同的糖果，他每次可以吃1颗或2颗糖果，直到吃完为止．请问他共有多少种不同的组合方法来吃光这些糖果？
<gadget id="calculator">1 + 2</gadget>
<output>3</output>

<gadget id="calculator">2 + 3</gadget>
<output>5</output>

<gadget id="calculator">3 + 5</gadget>
<output>8</output>

<gadget id="calculator">5 + 8</gadget>
<output>13</output>

<gadget id="calculator">8 + 13</gadget>
<output>21</output>

<gadget id="calculator">13 + 21</gadget>
<output>34</output>

<gadget id="calculator">21 + 34</gadget>
<output>55</output>

<gadget id="calculator">34 + 55</gadget>
<output>89</output>

<result>89</result>