Start

2018-03-24 18:00 CET

NAIPC 2018

End

2018-03-24 23:00 CET
The end is near!
Contest is over.
Not yet started.
Contest is starting in -212 days 8:01:01

Time elapsed

5:00:00

Time remaining

0:00:00

Problem J
Winter Festival

Peter’s favorite season is winter. Caught up in the festivities, Peter would like to decorate his city.

The city has many areas for things like ice skating, skiing, and snowball fights. There are roads connecting some pairs of areas. Peter would like to put a special decoration along each of these roads. There are three types of decorations of costs $0$, $1$, and $2$, respectively.

Peter would like his decoration to meet some properties:

  • For any pair of distinct roads adjacent to an area, let $a$ and $b$ be the costs of decorations along those roads. It must hold that $(a+b) \bmod 3 \neq 1$.

  • The sum of costs along any cycle must be an odd number.

A cycle is a sequence of areas connected by roads that form a loop. Each area may appear exactly once in the loop.

Peter would like to know: What is the cheapest amount he can pay to decorate his city the way he wants?

Input

Each input will consist of a single test case. Note that your program may be run multiple times on different inputs. Each test case will begin with a line with two integers $n$ and $m$ ($1 \le n,m \le 10^5$), where $n$ is the number of areas and $m$ is the number of roads. The areas are numbered $1..n$.

Each of the next $m$ lines will each contain two integers $a$ and $b$ ($1 \le a < b \le n$), indicating that there is a road directly connecting areas $a$ and $b$. No two roads will connect the same two areas. It may or may not be possible to get from every area to every other area along the roads.

Output

Output a single integer, which is the minimum cost of decorating the city, or $-1$ if it isn’t possible to decorate the city according to Peter’s properties.

Sample Input 1 Sample Output 1
5 8
1 4
4 5
1 5
1 2
1 3
2 3
3 5
2 5
-1
Sample Input 2 Sample Output 2
6 5
2 4
3 5
1 5
3 6
1 6
5
Sample Input 3 Sample Output 3
10 10
5 8
2 6
3 9
1 4
9 10
4 6
5 9
7 8
7 10
2 3
5