#include <stdio.h>
void merge(int arr{{^^%5B%5D^^}}, int left, int mid, int right) {
int n1 = mid - left + 1;
int n2 = right - mid;
int L[n1], R[n2];
for (int i = 0; i < n1; i++) L[i] = arr[left + i];
for (int i = 0; i < n2; i++) R[i] = arr[mid + 1 + i];
int i = 0, j = 0, k = left;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k++] = L[i++];
} else {
arr[k++] = R[j++];
}
}
while (i < n1) arr[k++] = L[i++];
while (j < n2) arr[k++] = R[j++];
}
void mergeSort(int arr{{^^%5B%5D^^}}, int left, int right) {
if (left < right) {
int mid = left + (right - left) / 2;
mergeSort(arr, left, mid);
mergeSort(arr, mid + 1, right);
merge(arr, left, mid, right);
}
}
int main() {
int N;
scanf("%d", &N);
int arr[N];
for (int i = 0; i < N; i++) {
scanf("%d", &arr[i]);
}
int X;
scanf("%d", &X);
mergeSort(arr, 0, N - 1);
// Print sorted array
for (int i = 0; i < N; i++) {
printf("%d ", arr[i]);
}
printf("\n");
// Count elements greater than X
int count = 0;
for (int i = 0; i < N; i++) {
if (arr[i] > X) count++;
}
printf("%d", count);
return 0;
}