#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 998244353;
const double eps = 1e-8;
const int maxn = 3e5 + 10;
const int maxm = 200005;
int n, m;
void solve() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
  }
  int f = 1;
  for (int i = 0; i < n; i++) {
    printf("%d", f);
    f = f ^ 1;
  }
  printf("\n");
  return;
}
int main() {
  solve();
  return 0;
}
