#include<bits/stdc++.

h>
using namespace std;
template<class T>
void print(T arr[],int n) {
for(int i=0;i<n;i++)
cout<<arr[i]<<" ";
cout<<endl;
}
int find(int arr[],int start,int end) {
int mid = (start + end )/2;
if(mid == start || mid == end)
return mid;
if(arr[mid] == arr[mid+1])
return find(arr,mid+1,end);
else
return find(arr,start,mid-1);
}
int main() {
int a[][4] = {5,7,5,9,
4,6,3,1,
2,9,0,6};
int *p;
int (*q)[4];
p = (int*)a;
q = a;
printf("")
return 0;
}