





def 			lowerCamelCase__	(__lowerCamelCase = 4000000		):

     if n <= 1:
          return 0
     _SCREAMING_SNAKE_CASE				:		Dict  			=							0
     _SCREAMING_SNAKE_CASE				:		Optional[Any]  			=							2
     _SCREAMING_SNAKE_CASE				:		List[str]  			=							0
     while 4 * b + a <= n:
          _SCREAMING_SNAKE_CASE			,	_SCREAMING_SNAKE_CASE				:		List[str]  			=							b, 4 * b + a
          count += a
     return count + b


if __name__ == "__main__":
       print(f"{solution() = }")






from itertools import permutations






def 			lowerCamelCase__	():
     _SCREAMING_SNAKE_CASE				:		Dict  			=							list(map("".join,				permutations("0123456789"		)		)		)
     return result[999999]


if __name__ == "__main__":
       print(solution())