Problem: Dima came to the horse land. There are n horses living in the land. Each horse in the horse land has several enemies (enmity is a symmetric relationship). The horse land isn't very hostile, so the number of enemies of each horse is at most 3.

Right now the horse land is going through an election campaign. So the horses trusted Dima to split them into two parts. At that the horses want the following condition to hold: a horse shouldn't have more than one enemy in its party.

Help Dima split the horses into parties. Note that one of the parties can turn out to be empty.

Input

The first line contains two integers n, m <image> — the number of horses in the horse land and the number of enemy pairs.

Next m lines define the enemy pairs. The i-th line contains integers ai, bi (1 ≤ ai, bi ≤ n; ai ≠ bi), which mean that horse ai is the enemy of horse bi.

Consider the horses indexed in some way from 1 to n. It is guaranteed that each horse has at most three enemies. No pair of enemies occurs more than once in the input.

Output

Print a line, consisting of n characters: the i-th character of the line must equal "0", if the horse number i needs to go to the first party, otherwise this character should equal "1".

If there isn't a way to divide the horses as required, print -1.

Examples

Input

3 3
1 2
3 2
3 1


Output

100


Input

2 1
2 1


Output

00


Input

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


Output

0110000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void Get(int &Ret) {
  char CH;
  bool FL = 0;
  for (; CH = getchar(), CH < '0' || CH > '9';)
    if (CH == '-') FL = 1;
  for (Ret = CH - '0'; CH = getchar(), CH >= '0' && CH <= '9';
       Ret = Ret * 10 + CH - '0')
    ;
  FL && (Ret = -Ret);
}
void Get(long long &Ret) {
  char CH;
  bool FL = 0;
  for (; CH = getchar(), CH < '0' || CH > '9';)
    if (CH == '-') FL = 1;
  for (Ret = CH - '0'; CH = getchar(), CH >= '0' && CH <= '9';
       Ret = Ret * 10 + CH - '0')
    ;
  FL && (Ret = -Ret);
}
const int MAXN = 310000;
struct node {
  int v;
  node *next;
};
node Edge[MAXN * 2];
node *Ecnt = &Edge[0];
node *adj[MAXN];
inline void addedge(int u, int v) {
  node *p = ++Ecnt;
  p->v = v;
  p->next = adj[u];
  adj[u] = p;
}
int n, m;
void Read() {
  Get(n);
  Get(m);
  int i;
  for (i = 1; i <= m; i++) {
    int u, v;
    Get(u);
    Get(v);
    addedge(u, v);
    addedge(v, u);
  }
}
int col[MAXN];
void DFS(int u) {
  int cnt = 0;
  for (node *p = adj[u]; p; p = p->next)
    if (col[u] == col[p->v]) cnt++;
  if (cnt > 1) {
    col[u] ^= 1;
    for (node *p = adj[u]; p; p = p->next)
      if (col[u] == col[p->v]) DFS(p->v);
  }
}
void Solve() {
  int i;
  for (i = 1; i <= n; i++) DFS(i);
  for (i = 1; i <= n; i++) printf("%d", col[i]);
  printf("\n");
}
int main() {
  Read();
  Solve();
  return 0;
}