Under construction

Still being built. Things may change

Konstrukcija Special Judge

Time limit1sMemory limit1024 MB

Summary
Given the output of problem 19232 as input, print the original input of that problem, namely tns(1, N) of the graph.
Level

Medium4 of 10

Topics
Implementation, Graph
Solved
No attempts yet

Problem

Make a special judge for problem 19232 Konstrukcija.

Input

The output of problem 19232 is given as input.

Output

Print the input of problem 19232. In other words, print tns(1, N) of the graph in that input.

Constraints

All input and output conditions are the same as in problem 19232.

Examples3

  1. Example 1

    Input
    6 6
1 4
1 5
4 3
5 3
3 2
2 6
    Expected output
    0

  2. Example 2

    Input
    1 0
    Expected output
    1

  3. Example 3

    Input
    6 8
1 2
1 3
1 4
1 5
5 4
2 6
3 6
4 6
    Expected output
    2