#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>

/*
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")
*/

#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e13;
//const int mod = 2600000069;
//const int p = 179;

const int MAXN = 200000;

int n, m;
vector<vector<int>> g, gr;
vector<int> topsort, comp(MAXN, -1), num;
vector<bool> used(MAXN, 0);
int cur_comp, cnt;
int wat;

void ts(int v) {
    used[v] = 1;
    for (auto u : g[v]) {
        if (!used[u]) ts(u);
    }
    topsort.pb(v);
}

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

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    freopen("2sat.in", "r", stdin);
    freopen("2sat.out", "w", stdout);
    while (cin >> n) {
        cin >> m;
        topsort.clear();
        num.clear();
        wat = (n << 1);
        g.resize(wat);
        gr.resize(wat);
        for (int i = 0; i < wat; ++i) {
            used[i] = 0;
            comp[i] = -1;
        }
        int ind1, ind2, val1, val2;
        for (int i = 0; i < m; ++i) {
            cin >> ind1 >> val1 >> ind2 >> val2;
            if (val1) {
                if (val2) {
                    g[ind1 + n].pb(ind2);
                    g[ind2 + n].pb(ind1);
                    gr[ind2].pb(ind1 + n);
                    gr[ind1].pb(ind2 + n);
                } else {
                    g[ind1 + n].pb(ind2 + n);
                    g[ind2].pb(ind1);
                    gr[ind2 + n].pb(ind1 + n);
                    gr[ind1].pb(ind2);
                }
            } else {
                if (val2) {
                    g[ind1].pb(ind2);
                    g[ind2 + n].pb(ind1 + n);
                    gr[ind2].pb(ind1);
                    gr[ind1 + n].pb(ind2 + n);
                } else {
                    g[ind1].pb(ind2 + n);
                    g[ind2].pb(ind1 + n);
                    gr[ind2 + n].pb(ind1);
                    gr[ind1 + n].pb(ind2);
                }
            }
        }
//        for (int i = 0; i < 2 * n; i++) {
//            if (!used[i]) ts(i);
//        }
        cur_comp = 0;
        cnt = 0;
//        reverse(all(topsort));
        for (int i = wat - 1; i >= 0; --i) {
            if (!used[i]) ts(i);
            if (comp[i] == -1) {
                cc(i, cur_comp);
                cur_comp++;
                num.pb(cnt);
                cnt++;
            }
        }
        for (int i = 0; i < n; ++i) {
            if (num[comp[i]] < num[comp[i + n]]) {
                cout << 0;
            } else cout << 1;
        }
        cout << "\n";
    }
}