title: Count Number Of Ways To Fill A N X 4 Grid Using 1 X 4 Tiles
signature: def count_number_of_ways_to_fill_a_n_x_4_grid_using_1_x_4_tiles(n):
test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(n, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              n),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver(61, 188941273)
      print(f"TEST-0...{result}")
  
      result = driver(22, 657)
      print(f"TEST-1...{result}")
  
      result = driver(65, 685792227)
      print(f"TEST-2...{result}")
  
      result = driver(57, 52054840)
      print(f"TEST-3...{result}")
  
      result = driver(36, 59864)
      print(f"TEST-4...{result}")
  
      result = driver(25, 1728)
      print(f"TEST-5...{result}")
  
      result = driver(16, 95)
      print(f"TEST-6...{result}")
  
      result = driver(26, 2385)
      print(f"TEST-7...{result}")
  
      result = driver(92, 4123691589365)
      print(f"TEST-8...{result}")
  
      result = driver(5, 3)
      print(f"TEST-9...{result}")
  
      sys.exit(0)
source_py: def count_number_of_ways_to_fill_a_n_x_4_grid_using_1_x_4_tiles(n):
      dp = [0 for _ in range((n + 1))]
      for i in range(1, (n + 1)):
          if (i <= 3):
              dp[i] = 1
          elif (i == 4):
              dp[i] = 2
          else:
              dp[i] = (dp[(i - 1)] + dp[(i - 4)])
      return dp[n]
source_cpp: int count_number_of_ways_to_fill_a_n_x_4_grid_using_1_x_4_tiles(int n) {
    int dp [ n + 1 ];
    dp [ 0 ] = 0;
    for ( int i = 1;
    i <= n;
    i ++ ) {
      if ( i >= 1 && i <= 3 ) dp [ i ] = 1;
      else if ( i == 4 ) dp [ i ] = 2;
      else dp [ i ] = dp [ i - 1 ] + dp [ i - 4 ];
    }
    return dp [ n ];
  }