求数n最少需要多少步才能变成Fibonacci数列

public static void main(String[] args) {
     Scanner scanner=new Scanner(System.in);
     int n=scanner.nextInt();
     int m=buchang(n);
     System.out.println(m);
}
public static int buchang(int n) {
	List<Integer> list=new ArrayList<Integer>();
	int count=0;
	int[] array=new int[n];
	for(int i=2;i<array.length;i++) {
		array[0]=0;
		array[1]=1;
		array[i]=array[i-1]+array[i-2];
		int m=Math.abs(array[i]-n);
        list.add(m);
 	}
	int k=Collections.min(list);
	return k;
}