import sys

def solve():
    """
    Solves the Very Simple Traveling Salesman Problem.

    Reads the number of vertices N and edges M from the input.
    Since the problem specifies that the graph is complete (M = N*(N-1)/2)
    and all edge weights are 1, any Hamiltonian cycle (visiting each
    vertex exactly once and returning to the start) will consist of
    exactly N edges.
    The total weight of any such cycle is the sum of the weights of its
    N edges. Since each edge has weight 1, the total weight is N * 1 = N.
    Therefore, the minimum weight of such a cycle is always N.

    The code only needs to read N and print it. The edge details are
    not required for the calculation.
    """
    # Read N and M from the first line of input
    # n, m = map(int, sys.stdin.readline().split())
    
    # We only actually need N
    line1 = sys.stdin.readline().split()
    n = int(line1[0])

    # The rest of the input lines describe the edges, but we don't need them.
    # for _ in range(m):
    #     sys.stdin.readline() # Read and discard edge lines if needed

    # The minimum weight of a Hamiltonian cycle in a complete graph
    # where all edge weights are 1 is simply N.
    print(n)

if __name__ == "__main__":
    solve()