title: Zeckendorfs Theorem Non Neighbouring Fibonacci Representation
signature: zeckendorfsTheoremNonNeighbouringFibonacciRepresentation(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          54, 
          34)
      }");
  
      print("TEST-1...${driver(
          71, 
          55)
      }");
  
      print("TEST-2...${driver(
          64, 
          55)
      }");
  
      print("TEST-3...${driver(
          71, 
          55)
      }");
  
      print("TEST-4...${driver(
          96, 
          89)
      }");
  
      print("TEST-5...${driver(
          43, 
          34)
      }");
  
      print("TEST-6...${driver(
          70, 
          55)
      }");
  
      print("TEST-7...${driver(
          94, 
          89)
      }");
  
      print("TEST-8...${driver(
          95, 
          89)
      }");
  
      print("TEST-9...${driver(
          69, 
          55)
      }");
  
      return 0;
  }
source_py: def zeckendorfs_theorem_non_neighbouring_fibonacci_representation(n):
      if ((n == 0) or (n == 1)):
          return n
      (f1, f2, f3) = (0, 1, 1)
      while (f3 <= n):
          f1 = f2
          f2 = f3
          f3 = (f1 + f2)
      return f2
source_cpp: int zeckendorfs_theorem_non_neighbouring_fibonacci_representation(int n) {
    if ( n == 0 || n == 1 ) return n;
    int f1 = 0, f2 = 1, f3 = 1;
    while ( f3 <= n ) {
      f1 = f2;
      f2 = f3;
      f3 = f1 + f2;
    }
    return f2;
  }