
"""simple docstring"""




def     __magic_name__		(					UpperCamelCase     :		Tuple							,		UpperCamelCase     :		Optional[int]							,		UpperCamelCase     :		Union[str, Any]							,		UpperCamelCase     :		Tuple     )     ->						Optional[Any]:
    a__		=			[False] * len(__UpperCAmelCase     )
    a__		=			[]
    queue.append(__UpperCAmelCase     )
    a__		=			True

    while queue:
        a__		=			queue.pop(0     )
        for ind in range(len(graph[u]     )     ):
            if visited[ind] is False and graph[u][ind] > 0:
                queue.append(__UpperCAmelCase     )
                a__		=			True
                a__		=			u

    return visited[t]



def     __magic_name__		(					UpperCamelCase     :		List[str]							,		UpperCamelCase     :		Optional[Any]							,		UpperCamelCase     :		Any     )     ->						Tuple:
    a__		=			[-1] * (len(__UpperCAmelCase     ))
    a__		=			0
    while bfs(__UpperCAmelCase							,		__UpperCAmelCase							,		__UpperCAmelCase							,		__UpperCAmelCase     ):
        a__		=			float('Inf'     )
        a__		=			sink

        while s != source:
            # Find the minimum value in select path
            a__		=			min(__UpperCAmelCase							,		graph[parent[s]][s]     )
            a__		=			parent[s]

        max_flow += path_flow
        a__		=			sink

        while v != source:
            a__		=			parent[v]
            graph[u][v] -= path_flow
            graph[v][u] += path_flow
            a__		=			parent[v]
    return max_flow


a		:       List[Any]     						=       [
    [0, 16, 13, 0, 0, 0],
    [0, 0, 10, 12, 0, 0],
    [0, 4, 0, 0, 14, 0],
    [0, 0, 9, 0, 0, 20],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]

a		:       int     						=       0, 5



print(ford_fulkerson(graph, source, sink))








'''simple docstring'''

from collections.abc import Generator


def 						__magic_name__       (      )						->   Generator[int, None, None]:

					'''simple docstring'''

					snake_case_     ,snake_case_		     =							0, 1
					while True:
										snake_case_     ,snake_case_		     =							b, a + b
										yield b


def 						__magic_name__       (      __UpperCAmelCase = 1000      )						->   int:

					'''simple docstring'''

					snake_case_		     =							1
					snake_case_		     =							fibonacci_generator()
					while len(str(next(__UpperCAmelCase      )      )      ) < n:
										answer += 1
					return answer + 1


if __name__ == "__main__":
							print(solution(int(str(input()).strip())))

