title: Nth Non Fibonacci Number
signature: int nthNonFibonacciNumber(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(76, 85); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(91, 101); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(62, 71); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(65, 74); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(83, 93); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(57, 66); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(76, 85); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(6, 11); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(2, 6); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(86, 96); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }