Straightforward Fibonacci

import java.util.ArrayList;
import java.util.Iterator;
import java.util.Scanner;


public class Fibonacci {

    public static void main(String[] args) {
        System.out.println("Please enter the number of Fibonacci numbers to display: ");
        Scanner s = new Scanner(System.in);
        Integer n = s.nextInt();

        ArrayList<Long> fib = new ArrayList<Long>();

        for(int i=0; i < n; i++) {
            if(i < 2) {
                fib.add((long)i);
            }
            else {
                fib.add( fib.get(i-2) + fib.get(i-1));
            }
        }

        Iterator<Long> iter = fib.listIterator();
        if(iter.hasNext())
            System.out.print(iter.next());
        while(iter.hasNext()) {
            System.out.print(", " + (Long)iter.next());
        }
    }

}