#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <map>

//#include "optimization.h"
#include <unordered_map>

#include <cassert>
#include <cstdio>
#include <algorithm>


using namespace std;
int n, m;
vector<bool> mark;
vector<int> comp;
vector<vector<int>> graph;
vector<vector<int>> graph2;
vector<int> order;
int cc = 0;

void dfs1(int v) {
    mark[v] = true;
    for (auto u: graph[v]) {
        if (!mark[u]) dfs1(u);
    }
    order.push_back(v);
}

void dfs2(int v, int cc) {
    comp[v] = cc;
    for (auto u: graph2[v]) {
        if (comp[u] == -1) {
            dfs2(u, cc);
        }
    }
}

int main() {
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    while(cin >> n >> m){


//    vector<bool> x((n+1)*2, 0);
    graph.assign(n * 2, vector<int>());
    graph2.assign(n * 2, vector<int>());
    for (int i = 0; i < m; i++) {
        int a, a_val, b, b_val;
        cin >> a >> a_val >> b >> b_val;

        graph[2 * a + 1 - a_val].push_back(2 * b + b_val);
        graph[2 * b + 1 - b_val].push_back(2 * a + a_val);
        graph2[2 * b + b_val].push_back(2 * a + 1 - a_val);
        graph2[2 * a + a_val].push_back(2 * b + 1 - b_val);
    }

    mark.assign(2 * (n), false);
    for (int i = 0; i < 2 * n; i+=1) {
        if (!mark[i]) dfs1(i);
    }
    comp.assign(2 * (n), -1);
    reverse(order.begin(), order.end());
    for (auto v: order) {
        if (comp[v] == -1) {
            dfs2(v, ++cc);
        }
    }

    for (int i = 0; i < 2*n; i+=2) {
        cout << (comp[i + 1] > comp[i]);
    }
    cout << '\n';
}}