#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class pt
{
    public:
    int x,y;
     pt(){}
    pt(int a,int b){x=a;y=b;}
    void set(int a,int b){x=a;y=b;}
    void print()
    {
        cout<<x<<","<<y<<endl;
    }
    void move(int option)
    {
    //UL-0, UR-1, R-2, LR-3, LL-4, L-5
    switch(option)
    {
        case 0: x-=2; y-=1;break;
        case 1: x-=2; y+=1;break;
        case 2: x+=0; y+=2;break;
        case 3: x+=2; y+=1;break;
        case 4: x+=2; y-=1;break;
        case 5: x+=0; y-=2;break;
        default: cout<<"uh oh";
    }
    }
};
//x is ROW and y is COLUMN, which is reverse of commmon usage !!
int n;
pt start,endd;
vector <pt> a;
vector <string> moves;
//priority order:
//UL, UR, R, LR, LL, L
bool range(pt x)
{
    if(x.x<n &&x.y<6)
        return true;
    else
        return false;
}
int noOfMoves=0;
void check(pt cpos=start)
{
    if(noOfMoves>n)
        return;
    else
    {
        for(int i=0;i<6;++i)
        {
            
        }
    }
    
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    cin>>n;
    int rs,cs,re,ce;
    cin>>rs>>cs>>re>>ce;
    start.set(rs,cs);
    endd.set(re,ce);
    check();
    //pt w(7,7);
    //cout<<range(w);
    int lp;
    cin>>lp;
   /* start.print();
    start.move(0);
    start.move(0);
    start.move(0);
    start.move(5);
    start.print();
    */
    return 0;
}