title: Nth Non Fibonacci Number
signature: function nthNonFibonacciNumber($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        76, 
        85));
      
      printf("TEST-1...%s\n",driver(
        91, 
        101));
      
      printf("TEST-2...%s\n",driver(
        62, 
        71));
      
      printf("TEST-3...%s\n",driver(
        65, 
        74));
      
      printf("TEST-4...%s\n",driver(
        83, 
        93));
      
      printf("TEST-5...%s\n",driver(
        57, 
        66));
      
      printf("TEST-6...%s\n",driver(
        76, 
        85));
      
      printf("TEST-7...%s\n",driver(
        6, 
        11));
      
      printf("TEST-8...%s\n",driver(
        2, 
        6));
      
      printf("TEST-9...%s\n",driver(
        86, 
        96));
      
  }
  
  main();
  ?>
source_py: def nth_non_fibonacci_number(n):
      prevPrev = 1
      prev = 2
      curr = 3
      while (n > 0):
          prevPrev = prev
          prev = curr
          curr = (prevPrev + prev)
          n = (n - ((curr - prev) - 1))
      n = (n + ((curr - prev) - 1))
      return (prev + n)
source_cpp: int nth_non_fibonacci_number(int n) {
    int prevPrev = 1, prev = 2, curr = 3;
    while ( n > 0 ) {
      prevPrev = prev;
      prev = curr;
      curr = prevPrev + prev;
      n = n - ( curr - prev - 1 );
    }
    n = n + ( curr - prev - 1 );
    return prev + n;
  }