In Java

The Fibonacci numbers Fn are defined as being the sum of the two previous Fibonacci numbers, i.e.,

Fn = Fn-2 + Fn-1 

Write a program that will accept an single integer input (and check to make sure that it is a positive integer n and print out the nth Fibonacci number.

Please note that F0 is defined as 0 and F1 is defined as 1.