#include<bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 20005
int arr[maxn],n;
void bubble_sort(){
    for(int i=0;i<n-1;i++){
        for(int j=0;j<n-1;j++){
            if(arr[j]>arr[j+1])swap(arr[j],arr[j+1]);
        }
    }
}
signed main(){
    while(cin>>n){
        for(int i=0;i<n;i++){
            cin>>arr[i];
        }
        bubble_sort();
        for(int i=0;i<n;i++){
            cout<<arr[i]<<' ';
        }
        cout<<'\n';
    }
}

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 20005
int arr[maxn],n;
void selection_sort(){
    for(int i=0;i<n-1;i++){
        int mnindex=i;
        for(int j=i+1;j<n;j++){
            if(arr[j]<arr[mnindex])mnindex=j;
        }
        swap(arr[i],arr[mnindex]);
    }
}
main(){
    while(cin>>n){
        for(int i=0;i<n;i++){
            cin>>arr[i];
        }
        selection_sort();
        for(int i=0;i<n;i++){
            cout<<arr[i]<<' ';
        }
        cout<<'\n';
    }
}

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 20005
int arr[maxn],n;
void insertion_sort(){
    for (int i=1; i<n;i++) {
        int key = arr[i];
        int j=i-1;
        while (key<arr[j] && j>=0) {
            arr[j+1]=arr[j];
            j--;
        }
        arr[j+1]=key;
    }
}
main(){
    while(cin>>n){
        for(int i=0;i<n;i++){
            cin>>arr[i];
        }
        insertion_sort();
        for(int i=0;i<n;i++){
            cout<<arr[i]<<' ';
        }
        cout<<'\n';
    }
}

// C++ Program to demonstrate how to implement the quick
// sort algorithm
#include <bits/stdc++.h>
using namespace std;

int partition(vector<int> &vec, int low, int high) {

    // Selecting last element as the pivot
    int pivot = vec[high];

    // Index of elemment just before the last element
    // It is used for swapping
    int i = (low - 1);

    for (int j = low; j <= high - 1; j++) {

        // If current element is smaller than or
        // equal to pivot
        if (vec[j] <= pivot) {
            i++;
            swap(vec[i], vec[j]);
        }
    }

    // Put pivot to its position
    swap(vec[i + 1], vec[high]);

    // Return the point of partition
    return (i + 1);
}

void quickSort(vector<int> &vec, int low, int high) {

    // Base case: This part will be executed till the starting
    // index low is lesser than the ending index high
    if (low < high) {

        // pi is Partitioning Index, arr[p] is now at
        // right place
        int pi = partition(vec, low, high);

        // Separately sort elements before and after the
        // Partition Index pi
        quickSort(vec, low, pi - 1);
        quickSort(vec, pi + 1, high);
    }
}

int main() {
    vector<int> vec = {10, 7, 8, 9, 1, 5};
    int n = vec.size();
	
  	// Calling quicksort for the vector vec
    quickSort(vec, 0, n - 1);

    for (auto i : vec) {
        cout << i << " ";
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 1000005
int arr[maxn],n;
void mergesort(int l,int r){
    if(l==r)return;
    int mid=(l+r)/2;
    mergesort(l,mid);
    mergesort(mid+1,r);
    int n1=mid-l+1,n2=r-mid;
    int L[n1+1],R[n2+1];
    for(int i=0;i<n1;i++)L[i]=arr[l+i];
    for(int i=0;i<n2;i++)R[i]=arr[mid+i+1];
    int x=0,y=0,z=l;
    while(x<n1 && y<n2){
        if(L[x]<R[y]){
            arr[z++]=L[x++];
        }
        else arr[z++]=R[y++];
    }
    while(x<n1)arr[z++]=L[x++];
    while(y<n2)arr[z++]=R[y++];
}
main(){
    int n;
    while(cin>>n){
        for(int i=0;i<n;i++)cin>>arr[i];
        mergesort(0,n-1);
        for(int i=0;i<n;i++)cout<<arr[i]<<' ';
    }
}

int l=0;
int r=n;
int ans=-1;
  while(l<r){
    int mid=(l+r)/2;
    if(arr[mid]>q)r=mid;
    else if(arr[mid]<q)l=mid+1;
    else{
      ans=mid;
    break;
  }
}

int l=0;
int r=n-1;
int ans=-1;
  while(l<=r){
    int mid=(l+r)/2;
    if(arr[mid]>q)r=mid-1;
    else if(arr[mid]<q)l=mid+1;
    else{
    	ans=mid;
    	break;
  }
}

vector<int>v={3,5,1,2};

int main(){
    sort(v.begin(), v.end());
	cout << *lower_bound(v.begin(), v.end(), 3) << '\n'; // 3
    cout << *lower_bound(v.begin(), v.end(), 2) << '\n'; // 2
    cout << *upper_bound(v.begin(), v.end(), 3) << '\n'; // 5
    cout << *lower_bound(v.begin(), v.end(), 6) << '\n'; // 超出範圍 值不定 
}

int i = 0, j = n - 1;
while(i < j){
    int sum = a[i] + a[j];
    if(sum == target){
        cout << i << " " << j;
        break;
    }
    else if(sum < target) i++;
    else j--;
}

int i = 0, j = 0;
while(i < A.size() && j < B.size()){
    if(A[i] == B[j]) j++;
    i++;
}
cout << (j == B.size() ? "YES" : "NO");