Fibonacci and finding nth fibo number, C#

Language: Layout:

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            //Your code goes here
            for (int i = 0; i < 5; i++)
	{
	    Console.WriteLine(Fibonacci(i));
    }
        Console.WriteLine(GetNthFibonacci_Ite(5));
            
        }
        
        public static int Fibonacci(int n)
    {
	int a = 0;
	int b = 1;
	// In N steps compute Fibonacci sequence iteratively.
	for (int i = 0; i < n; i++)
	{
	    int temp = a;
	    a = b;
	    b = temp + b;
	}
	return a;
    }
 
      
        
   //     Here we are using an integer array to keep the Fibonacci numbers until n and returning the nth Fibonacci number.

public static int GetNthFibonacci_Ite(int n)
        {
            Console.WriteLine("nth fib number");
            int number = n - 1; //Need to decrement by 1 since we are starting from 0
            int[] Fib = new int[number + 1];
            Fib[0]= 0;
            Fib[1]= 1;
 
            for (int i = 2; i <= number;i++)
            {
               Fib[i] = Fib[i - 2] + Fib[i - 1];
            }
            return Fib[number];
        }
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 0,12 sec, absolute running time: 0,09 sec, cpu time: 0,08 sec, average memory usage: 13 Mb, average nr of threads: 3