## Introduction

Suppose you have a ruler with numbers from **0** to **r-1**.
You place an ant between any two of the numbers, and it starts to crawl erratically on the ruler.
The ruler is so narrow that the ant cannot walk from one position to another without walking on all the numbers in between.
As the ant walks on a number for the first time, you record it, and this gives you a permutation of the **r** numbers.
We say that a permutation is _antsy_ if it can be generated by an ant in this way.
Alternatively, a permutation **p** is antsy if every entry **p[i]** except the first is within distance 1 from some previous entry.

## Examples

The length-6 permutation

    4, 3, 5, 2, 1, 0

is antsy, because **3** is within distance 1 of **4**, **5** is within distance 1 of **4**, **2** is within distance 1 from **3**, **1** is within distance 1 from **2**, and **0** is within distance 1 from **1**.
The permutation

    3, 2, 5, 4, 1, 0

is not antsy, because **5** is not within distance 1 of either **3** or **2**; the ant would have to pass through **4** to get to **5**.

## The task

Given a permutation of the numbers from **0** to **r-1** for some **1 ≤ r ≤ 100** in any reasonable format, output a truthy value if the permutation is antsy, and a falsy value if not.

## Test cases

    [0] -> True
    [0, 1] -> True
    [1, 0] -> True
    [0, 1, 2] -> True
    [0, 2, 1] -> False
    [2, 1, 3, 0] -> True
    [3, 1, 0, 2] -> False
    [1, 2, 0, 3] -> True
    [2, 3, 1, 4, 0] -> True
    [2, 3, 0, 4, 1] -> False
    [0, 5, 1, 3, 2, 4] -> False
    [6, 5, 4, 7, 3, 8, 9, 2, 1, 0] -> True
    [4, 3, 5, 6, 7, 2, 9, 1, 0, 8] -> False
    [5, 2, 7, 9, 6, 8, 0, 4, 1, 3] -> False
    [20, 13, 7, 0, 14, 16, 10, 24, 21, 1, 8, 23, 17, 18, 11, 2, 6, 22, 4, 5, 9, 12, 3, 15, 19] -> False
    [34, 36, 99, 94, 77, 93, 31, 90, 21, 88, 30, 66, 92, 83, 42, 5, 86, 11, 15, 78, 40, 48, 22, 29, 95, 64, 97, 43, 14, 33, 69, 49, 50, 35, 74, 46, 26, 51, 75, 87, 23, 85, 41, 98, 82, 79, 59, 56, 37, 96, 45, 17, 32, 91, 62, 20, 4, 9, 2, 18, 27, 60, 63, 25, 61, 76, 1, 55, 16, 8, 6, 38, 54, 47, 73, 67, 53, 57, 7, 72, 84, 39, 52, 58, 0, 89, 12, 68, 70, 24, 80, 3, 44, 13, 28, 10, 71, 65, 81, 19] -> False
    [47, 48, 46, 45, 44, 49, 43, 42, 41, 50, 40, 39, 38, 51, 37, 36, 52, 35, 34, 33, 32, 53, 54, 31, 30, 55, 56, 29, 28, 57, 58, 59, 60, 27, 26, 61, 25, 62, 63, 64, 65, 66, 67, 24, 23, 22, 21, 68, 69, 20, 19, 18, 17, 70, 71, 16, 15, 72, 73, 74, 75, 76, 14, 13, 12, 77, 11, 10, 9, 8, 78, 7, 79, 80, 6, 81, 5, 4, 3, 82, 2, 83, 84, 1, 85, 86, 87, 0, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99] -> True

Fun fact: for **r &ge; 1**, there are exactly **2<sup>r-1</sup>** antsy permutations of length **r**.