#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    
    
            cout<<"Impossible";
    
 /*vector<pair<int,int>> v;
    int i,j,k=0;
    
    
      
        for(j=0; j<n; j++)
        {
            if(abs(j - j_start) % 2 == 1)
            {
                i = i_start + 2;
                for( ; i<n; )
                {
                   v[k] = make_pair(i,j);
                    k++;
                    i = i + 4;
                }
                
              i = i_start - 2;
                for( ; i>=0; )
                {
                    v[k] = make_pair(i,j);
                    k++;
                    i = i - 4;
                }
            }
            else
            {
                i = i_start + 4;
                for( ; i<n; )
                {
                   v[k] = make_pair(i,j);
                    k++;
                    i = i + 4;
                }
                
              i = i_start - 4;
                for( ; i>=0; )
                {
                    v[k] = make_pair(i,j);
                    k++;
                    i = i - 4;
                }
            }
        }
    
  i=i_start; j=j_start+2;
    for(; j<n; j=j+2)
    {
        v[k] = make_pair(i,j);
        k++;
    }
    
    j=j_start-2;
    for(; j>=0; j=j-2)
    {
        v[k] = make_pair(i,j);
        k++;
    }
    pair <int,int> pair1;  pair1 = make_pair(i_end, j_end); int flag = 0;
    for(i=0; i<v.size(); i++)
    {
        if(v[i] == pair1)
            flag = 1;
    }
  
//if(flag == 0)
  //  cout<<"Impossible";  */
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}