#define _CRT_SECURE_NO_WaRNINGS
#include<bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double EPS = (1e-9);
typedef long long ll;
#define flush fflush(stdout), cout.flush()
#define all(v) ((v).begin()),((v).end())
#define rall(v) ((v).rbegin()),((v).rend())
#define clr(v,idx) memset(v,idx,sizeof(v))
#define rep(i,n) for(int(i)=0;(i)<(int)(n);(i)++)
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define lcm(a,b) (a*(b/__gcd(a,b)))
#define MOD 1000000007
#define endl '\n'
#define cp(a,b) ((conj(a)*(b)).real())
const ll dx[] = {1,-1,0,0,1,-1,1,-1};
const ll dy[] = {0,0,1,-1,1,-1,-1,1};
void file() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}
void fast()
{
	std::ios_base::sync_with_stdio(0);
	cin.tie(NULL); cout.tie(NULL);
}
const int OO=2e5+5;
int n,m;
int v[OO],t[OO];
vi arr;
map<int,int>ans;
int dist(int one, int two, int trr) { 
    if (trr - one > two - trr)return two; 
    else
        return one; 
} 

int solve(int n, int trr) { 
    if (trr <= arr[0]) 
        return arr[0]; 
    if (trr >= arr[n - 1]) 
        return arr[n - 1];
      int i = 0, j = n, md = 0; 
    while (i < j) { 
        md = (i + j) / 2; 
  
          if (trr <= arr[md]) { 
  
                return dist(arr[md - 1], arr[md], trr); 
  
            j = md; 
        } 
  
        else { 
            if (md <= n - 1 && trr <= arr[md + 1]) 
                return dist(arr[md], arr[md + 1], trr); 
            i = md + 1;  
        } 
    } 
    return arr[md]; 
} 

int main(int argc, char const *argv[])
{
	file();

	freopen("sorting.in","r",stdin);
	freopen("sorting.out","w",stdout);
	
	cout<<"2"<<endl;
	cout<<"4 5"<<endl;
	cout<<"2 5"<<endl;
}