#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
struct node {
  int u, v, cost;
};
vector<int> e[maxn];
int a[maxn];
int vis[maxn] = {0};
int num[maxn] = {0};
queue<int> s;
int dis[maxn];
int big[maxn] = {0}, small[maxn] = {0};
int cnt = 0;
vector<int> vec;
int main() {
  int n;
  cin >> n;
  int flg = 0;
  for (int i = 0; i < n; i++) {
    cout << (flg);
    flg ^= 1;
  }
}
