#include <iostream>
#include<malloc.h>
#include <bitset>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <iterator>
#include <assert.h>
using namespace std;

fstream g("gropi.out",ios::out);
int n,t;
int m,i;
long j,c,x1,x2,y1,y2,k;
int main()
{
    std::vector<bool> a(2000000000);
    std::fill( a.begin(), a.end(), false );
    std::vector<bool> b(2000000000);
    std::fill( b.begin(), b.end(), false );
    freopen("gropi.in","r",stdin);
    freopen("gropi.out","w",stdout);
    scanf("%li",&c);
   /* a[1]=(bool *)malloc(200000000*sizeof(bool));
    a[2]=(bool *)malloc(200000000*sizeof(bool));
     for(i=0;i<c;i++)
   { a[1][i]=0;
   a[2][i]=0;}
   scanf("%i",&n);
   for(i=0;i<n;i++)
   {
       scanf("%li %li",&x1,&y1);
       a[x1][y1]=1;
   }
   scanf("%i",&m);
for(i=0;i<m;i++)
{
    scanf("%li %li %li %li",&x1,&y1,&x2,&y2);
    t=0;
    if(y2<y1)
    {
        k=y2;
        y2=y1;
        y1=k;
        k=x2;
        x2=x1;
        x1=k;
    }
    for(j=y1;j<=y2;j++)
    {
        if(a[x1][j])
        {
            if(x1==1)
                x1=2;
            else
                x1=1;
        t++;
        }
        t++;
    }
    if(x1!=x2)
        t++;
    cout<<t<<endl;
}*/
    return 0;
}