long Fn_non_recursive1(int n) {
		if (n <= 0)
			return 0;
		if (n == 1)
			return 1L;

		long f[] = new long[n + 1];

		f[0] = 0;
		f[1] = 1;
		for (int i = 2; i <= n; i++) {
			f[i] = f[i - 1] + f[i - 2];
		}
		return f[n];
	}