// Fibonacci benchmark - recursive implementation
#include <stdio.h>
#include <stdint.h>

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

int main() {
    int64_t result = fib(35);
    printf("fib(35) = %lld\n", result);
    return 0;
}