int x = 4;

int main()
{
    return fib(10);
}

int fib(int n)
{
    if(n < 2)
        return n;
    
    return fib(n-1) + fib(n-2);
}

int nice(long s, short t)
{
    int y;
    byte x = 5 + t + y;
    if (x != 0)
        t = 5 + 1 * 5 * s + t;
    return 2 * (t + -1) - x;
}

int fac2(int n)
{
    int res = 1;
    while (n != 1)
    {
        res = res * n;
        n = n - 1;
    }
    return res;
}