Fibonacci number by table method

Fibonacci.java

import java.util.Scanner;

public class Fib {
    public static void main(String[] args) {
        Scanner scaner = new Scanner(System.in);
        int n = scaner.nextInt();
        if (n <= 80) {
            System.out.println("Fibonacci number for " + n + " = " + getFibonacci(n));
        } else {
            System.out.println("To big input");
        }
    }

    private static long getFibonacci(int n) {
        long[] fib = new long[n + 1];
        for (int i = 0; i < fib.length; i++) {
            if (i <= 1) {
                fib[i] = i;
            } else {
                fib[i] = fib[i - 1] + fib[i - 2];
            }
        }
        int pos = 0;
        for (long i : fib) {
            System.out.println(pos + " " + i);
            pos++;
        }
        return fib[n];
    }
}