Solution Review: Calculate nth Fibonacci Number Using Recursion

#include <iostream>
using namespace std;
// Recursive fibonacci function
int Fibonacci(int n) {
  // Base Case
  if (n == 0) {
    return 0;
  } 
  else if (n == 1) {
    return 1;
  }
  // Recursive Case
  else {
    return Fibonacci(n - 1) + Fibonacci(n - 2);
  }
}
// main function
int main() {
  // Initialize variable n
  int n = 4;
  // Declare variable result
  int result;
  // Call fibonacci function in main and store its output in result
  result = Fibonacci(4);
  // Print value of result
  cout << n << "th Fibonacci number = " << result;
  return 0;
}