Sonya decided to organize an exhibition of flowers. Since the girl likes only roses and lilies, she decided that only these two kinds of flowers should be in this exhibition.

There are nn flowers in a row in the exhibition. Sonya can put either a rose or a lily in the ii-th position. Thus each of nn positions should contain exactly one flower: a rose or a lily.

She knows that exactly mm people will visit this exhibition. The ii-th visitor will visit all flowers from lili to riri inclusive. The girl knows that each segment has its own beauty that is equal to the product of the number of roses and the number of lilies.

Sonya wants her exhibition to be liked by a lot of people. That is why she wants to put the flowers in such way that the sum of beauties of all segments would be maximum possible.

The first line contains two integers nn and mm (1≤n,m≤1031≤n,m≤103) — the number of flowers and visitors respectively.

Each of the next mm lines contains two integers lili and riri (1≤li≤ri≤n1≤li≤ri≤n), meaning that ii-th visitor will visit all flowers from lili to ririinclusive.

Print the string of nn characters. The ii-th symbol should be «0» if you want to put a rose in the ii-th position, otherwise «1» if you want to put a lily.

If there are multiple answers, print any.

In the first example, Sonya can put roses in the first, fourth, and fifth positions, and lilies in the second and third positions;

• in the segment [1…3][1…3], there are one rose and two lilies, so the beauty is equal to 1⋅2=21⋅2=2;
• in the segment [2…4][2…4], there are one rose and two lilies, so the beauty is equal to 1⋅2=21⋅2=2;
• in the segment [2…5][2…5], there are two roses and two lilies, so the beauty is equal to 2⋅2=42⋅2=4.

The total beauty is equal to 2+2+4=82+2+4=8.

In the second example, Sonya can put roses in the third, fourth, and sixth positions, and lilies in the first, second, and fifth positions;

• in the segment [5…6][5…6], there are one rose and one lily, so the beauty is equal to 1⋅1=11⋅1=1;
• in the segment [1…4][1…4], there are two roses and two lilies, so the beauty is equal to 2⋅2=42⋅2=4;
• in the segment [4…6][4…6], there are two roses and one lily, so the beauty is equal to 2⋅1=22⋅1=2.

The total beauty is equal to 1+4+2=71+4+2=7.

题意：在一个展览中,有n朵花，可以是玫瑰花，可以是百合花，有m个人，给出他们的观察区间，求出他们观察区间的最大美丽值，美丽值等于观察区间里玫瑰的数量乘以百合的数量。

分析：如果要两个数的乘积最大，那么这两个数要么相等,要么只差1。比如观察区间为(1,4)，一共有4朵花，如果玫瑰2朵，百合2朵，乘积为4；如果玫瑰3朵，百合1朵，乘积为3。所以只要让玫瑰和百合的分配变成一朵玫瑰，一朵百合就行。

 #include<cstdio>

 int main()

 {

     int n,m;

     while(~scanf("%d %d",&n,&m))

     {

         int a,b;

         for(int i=;i<=m;i++)

             scanf("%d %d",&a,&b);

         for(int i=;i<=n;i++)

         {

             if(i%==)

                 printf("");

             else

                 printf("");

         }

         printf("\n");

     }

     return ;

 }