#include<iostream> #include<list> #include<stack> #include<cstring> #include<queue> #include<algorithm> using namespace std; int main(){ int n,a[11][11],max=0,min=999999; cin>>n; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cin>>a[i][j]; } }for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(a[i][j]>max){ max=a[i][j]; }if(a[i][j]<min){ min=a[i][j]; } } }cout<<min<<" "<<max<<endl; return 0; }