import java.io.*;
public class Fibonacci {
 
	/**
	 * 
	 * @author HypnotiC      Jh0uBrt
	 * 
	 */
	public static void main(String[] args) throws IOException{
BufferedReader L = new BufferedReader(new InputStreamReader(System.in));
long CV,N1,N2,x,r;
N1 = 0;N2 = 1;x = 0;r=0;
String Cifra = N1+","+N2;
System.out.println("Cuantas veces desea realizar la sucesion? (desde 0,1 en adelante)");
CV = Integer.parseInt(L.readLine());
while (r != CV){
    x = N1+N2;
	Cifra = Cifra + "," + x;
	System.out.println(Cifra+",");
	N1 = N2; N2 = x;
	r++;
}
	}
 
}

package Fibonnaci;
import java.io.*;
 
/**
 *
 * @author WindHack
 */
public class Main {
 
    public static void main(String[] args)throws IOException
    {
       BufferedReader Fibo = new BufferedReader(new InputStreamReader(System.in));
       int A=1,B=0,i=0,Result,Terms;
 
       System.out.println("¿De cuántos términos desea la sucesión?: ");
       Terms = Integer.parseInt(Fibo.readLine());
       while (i <= Terms)
       {
           Result = A+B;
           A = B;
           B = Result;
           System.out.print(Result+",");
           i++;
       }
    }
}