// Fibonacci benchmark - recursive implementation
const std = @import("std");

fn fib(n: i64) i64 {
    if (n <= 1) return n;
    return fib(n - 1) + fib(n - 2);
}

pub fn main() void {
    const result = fib(35);
    std.debug.print("fib(35) = {d}\n", .{result});
}