long int fibolist(long int *lst, int n)
{
    if (n < 2) {
        return 1;
    } else {
        lst[n] = fibolist(lst, n-1)
                + fibolist(lst, n-2);
        return lst[n];
    }
}