#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323846;
const int mod = 1e9 + 7;
void unify(vector<int>& v) {
  auto ip = unique(v.begin(), v.end());
  v.resize(distance(v.begin(), ip));
}
long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); }
long long lcm(long long x, long long y) { return x * y / gcd(x, y); }
bool isPower2(long long x) { return x && (!(x & (x - 1))); }
vector<int> st(1005);
vector<int> e(1005);
int n, m;
int calc(string s) {
  long long sum = 0;
  for (int i = 0; i < m; i++) {
    int ones = 0, zero = 0;
    for (int j = st[i]; j <= e[i]; j++) {
      if (s[j] == '1')
        ones++;
      else
        zero++;
    }
    sum += ones * zero;
  }
  return sum;
}
void solve() {
  cin >> n >> m;
  string s1 = "", s2 = "";
  int move = 1;
  for (int i = 0; i < n; i++) {
    s1 += (move + '0');
    move = 1 - move;
  }
  move = 0;
  for (int i = 0; i < n; i++) {
    s2 += (move + '0');
    move = 1 - move;
  }
  for (int i = 0; i < m; i++) {
    cin >> st[i];
    cin >> e[i];
    st[i]--, e[i]--;
  }
  int op1 = calc(s1), op2 = calc(s2);
  if (op1 >= op2)
    cout << s1 << endl;
  else
    cout << s2 << endl;
}
int main() {
  int t = 1;
  while (t--) solve();
}
