Write a method that returns the nth value of the Fibonacci sequence.

int num = 0;
 int num2 = 1; 
 int fibonacci
for (int i= 0; i< n; i++)
{
    fibonacci = num + num2;
    num = num2;
    num2 = fibonacci;
}
System.out.print(num);

to find the n^th, you have to iterate the step n times and only print it when you've finished.