Fibonacci tail recursion in Java

gistfile1.java

public static long tailRecursive(long n) {
    if (n <= 2) {
        return 1;
    }
    return tailRecursiveAux(0, 1, n);
}

private static long tailRecursiveAux(long a, long b, long count) {
    if(count <= 0) { 
        return a;
    }
    return tailRecursiveAux(b, a+b, count-1);
}

tailRecursive(0) gives 1 but the correct result is 0 ;)