/*
int      %o/%lo(八进制) %d/%i/%ld/%li(十进制) %x/%lx(十六进制)[如标名为o/lo/d/i/lo/li/x/lx即输出为八进制/十进制/十六进制]
longlong %lld
float    %f/%e
double   %lf/%le
char     %c
char[]   %s
'a'=97
'z'=122
'A'=65
'Z'=90
'0'=48
'9'=57
*/
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <ctime>
#include <limits>
#include <assert.h>
#include <stdlib.h>
using namespace std;
#define LL long long
#define ull unsigned long long
const int N=1e5+10;
const int INF=0x3f3f3f3f;
const double pi=3.1416;
int n,m,ans;
struct sb{
	int x;
	int id;
}a[N];
bool cmp(sb a1,sb a2){
	return a1.x<a2.x;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].x;
		a[i].id=i;
	}
	cin>>m;
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++){
		cout<<a[i].x<<" ";
		if(a[i].x==m){
			ans=a[i].id;
		}
	}
	cout<<endl;
	if(ans){
		cout<<ans;
	}else{
		cout<<"Not Find";
	}
return 0;
}