class FibonacciNumbers {

  public int getRecursive(int n) {
    validateInput(n);
    if (n == 0 || n == 1) {
      return 1;
    } else {
      return getRecursive(n - 1) + getRecursive(n - 2);
    }
  }

}