UVA 495 - Fibonacci Freeze

This solution is in java :) 


 import java.util.*;
import java.math.*;
class Main{
public static void main(String[] args){
        Scanner sc= new Scanner(System.in);
       int n;
        while(sc.hasNext()){
n=sc.nextInt();
if(n==0){
System.out.println("The Fibonacci number for "+n+" is 0");
//continue;
}
else{
int count=0;
BigInteger a , b , c=BigInteger.valueOf(0);
a=BigInteger.valueOf(0);
b=BigInteger.valueOf(1);
c=a.add(b);
for(int i=1; i<n; i++){
a=b;
b=c;
c=a.add(b);
}
/*if(n==0)
System.out.println("The Fibonacci number for "+n+" is 0");
else*/
System.out.println("The Fibonacci number for "+n+" is "+b);
}
}
}
}