# Buggles' Island

You just received the traveling notes of your old aunt who traveled accross the country of the Buggles' Islands. She wrote down the altitude every kilometer during her trip, resulting in a sequence of numbers as follows.

    0 0 1 1 2 2 1 1 0 1 2 2 1 1 0

Here is a cut of the islands on that path:

           /***\       /*\         <-- 2 meters above the see level
       /***********\ /*******\     <-- 1 meter above the see level
    ***************************    <-- see level
    | | | | | | | | | | | | | |
    0 0 1 1 2 2 1 1 0 1 2 1 1 0    <-- altitude on each point

This example is constituted of four levels of island:

- 1 1 2 2 1 1 (the island on the left)
- 2 2 (the mountain topping the left island)
- 1 2 1 1 (the right island)
- 2 (the mountain on the right)

This can also be visualized this way:

    0 0(1 1(2 2)1 1)0(1(2)1 1)0

Could you write a little program to compute the amount of levels in a given sequence of altitudes? Actually, there is an iterative and a recursive solution to that problem.