// Fibonacci benchmark - recursive implementation
fn fib(n: i64) -> i64 {
    if n <= 1 { n }
    else { fib(n - 1) + fib(n - 2) }
}

fn main() {
    let result = fib(35);
    println!("fib(35) = {}", result);
}
