title: Nth Non Fibonacci Number
signature: function nth_non_fibonacci_number(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(76, 85);
      @printf("TEST-0...%s\n",result);
      
      result = driver(91, 101);
      @printf("TEST-1...%s\n",result);
      
      result = driver(62, 71);
      @printf("TEST-2...%s\n",result);
      
      result = driver(65, 74);
      @printf("TEST-3...%s\n",result);
      
      result = driver(83, 93);
      @printf("TEST-4...%s\n",result);
      
      result = driver(57, 66);
      @printf("TEST-5...%s\n",result);
      
      result = driver(76, 85);
      @printf("TEST-6...%s\n",result);
      
      result = driver(6, 11);
      @printf("TEST-7...%s\n",result);
      
      result = driver(2, 6);
      @printf("TEST-8...%s\n",result);
      
      result = driver(86, 96);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
  }