public static int fib(int n) {
    if (n <= 1)
        return n;
    int a = 0;
    int b = 1;
    for (int i = 0; i < n; i++) {
        int c = a;
        a = b;
        b = c + b;
    }
    return a;
}