#include<bits/stdc++.h>
using namespace std;
int n,m,b,a[2005],tmp;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	cin>>m;
	for(int i=1;i<=n;i++){
		if(a[i]==m){
			tmp=i;
			break;
		}
	}
	sort(a+1,a+n+1);
	int l=0,r=n+1;
	while(r-l>1){
		int md=(r+l)>>1;
		if(a[md]>=m)
			r=md;
		else
			l=md;
	}
	for(int i=1;i<=n;i++)
		cout<<a[i]<<" ";
	cout<<endl;	
	if(r<=n && a[r]==m)
		cout<<tmp;
	else
		cout<<"Not Find";
	return 0;
}