title: Nth Non Fibonacci Number
signature: pub fn nth_non_fibonacci_number(n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        76, 
        85
      ));
      
      println!("TEST-1...{}", driver(
        91, 
        101
      ));
      
      println!("TEST-2...{}", driver(
        62, 
        71
      ));
      
      println!("TEST-3...{}", driver(
        65, 
        74
      ));
      
      println!("TEST-4...{}", driver(
        83, 
        93
      ));
      
      println!("TEST-5...{}", driver(
        57, 
        66
      ));
      
      println!("TEST-6...{}", driver(
        76, 
        85
      ));
      
      println!("TEST-7...{}", driver(
        6, 
        11
      ));
      
      println!("TEST-8...{}", driver(
        2, 
        6
      ));
      
      println!("TEST-9...{}", driver(
        86, 
        96
      ));
      
  }
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;
  }