Problem: Vova and Marina love offering puzzles to each other. Today Marina offered Vova to cope with the following task.

Vova has a non-directed graph consisting of n vertices and m edges without loops and multiple edges. Let's define the operation of contraction two vertices a and b that are not connected by an edge. As a result of this operation vertices a and b are deleted and instead of them a new vertex x is added into the graph, and also edges are drawn from it to all vertices that were connected with a or with b (specifically, if the vertex was connected with both a and b, then also exactly one edge is added from x to it). Thus, as a result of contraction again a non-directed graph is formed, it contains no loops nor multiple edges, and it contains (n - 1) vertices.

Vova must perform the contraction an arbitrary number of times to transform the given graph into a chain of the maximum length. A chain of length k (k ≥ 0) is a connected graph whose vertices can be numbered with integers from 1 to k + 1 so that the edges of the graph connect all pairs of vertices (i, i + 1) (1 ≤ i ≤ k) and only them. Specifically, the graph that consists of one vertex is a chain of length 0. The vertices that are formed as a result of the contraction are allowed to be used in the following operations of contraction.

<image> The picture illustrates the contraction of two vertices marked by red.

Help Vova cope with his girlfriend's task. Find the maximum length of the chain that can be obtained from the resulting graph or else determine that it is impossible to obtain the chain.

Input

The first line contains two integers n, m (1 ≤ n ≤ 1000, 0 ≤ m ≤ 100 000) — the number of vertices and the number of edges in the original graph.

Next m lines contain the descriptions of edges in the format ai, bi (1 ≤ ai, bi ≤ n, ai ≠ bi), which means that there is an edge between vertices ai and bi. It is guaranteed that there is at most one edge between each pair of vertexes.

Output

If it is impossible to obtain a chain from the given graph, print  - 1. Otherwise, print the maximum possible number of edges in the resulting chain.

Examples

Input

5 4
1 2
2 3
3 4
3 5


Output

3


Input

4 6
1 2
2 3
1 3
3 4
2 4
1 4


Output

-1


Input

4 2
1 3
2 4


Output

2

Note

In the first sample test you can contract vertices 4 and 5 and obtain a chain of length 3.

In the second sample test it is initially impossible to contract any pair of vertexes, so it is impossible to achieve the desired result.

In the third sample test you can contract vertices 1 and 2 and obtain a chain of length 2.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
vector<int> G[maxn];
int d[maxn];
const int inf = 1e9;
int n, m;
int ans[maxn];
int f[maxn];
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
void merge(int x, int y) {
  int fx = find(x);
  int fy = find(y);
  if (fx == fy) return;
  f[fy] = fx;
}
void bfs(int s) {
  for (int i = 1; i <= n; i += 1) {
    d[i] = inf;
  }
  d[s] = 0;
  queue<int> q;
  q.emplace(s);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (auto v : G[u]) {
      if (d[v] == inf) {
        d[v] = d[u] + 1;
        q.emplace(v);
      }
    }
  }
  for (int i = 1; i <= n; i += 1) {
    if (d[i] != inf) ans[find(i)] = max(ans[find(i)], d[i]);
  }
}
int col[maxn];
bool dfs(int u, int c) {
  col[u] = c;
  for (auto v : G[u]) {
    if (col[v]) {
      if (col[v] != 3 - c) return false;
    } else if (!dfs(v, 3 - c))
      return false;
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  iota(f + 1, f + n + 1, 1);
  for (int i = 1; i <= m; i += 1) {
    int u, v;
    cin >> u >> v;
    G[u].emplace_back(v);
    G[v].emplace_back(u);
    merge(u, v);
  }
  if (!dfs(1, 1)) {
    cout << "-1\n";
  } else {
    int res = 0;
    for (int i = 1; i <= n; i += 1) {
      bfs(i);
    }
    for (int i = 1; i <= n; i += 1) {
      if (find(i) == i) res += ans[i];
    }
    cout << res << "\n";
  }
  return 0;
}