#include <iostream>
#include <iomanip>
#include <algorithm>

using namespace std;

#define MaxN 100

int main()
{
    float A[MaxN],B[MaxN],C[MaxN],D[MaxN],AS[MaxN];
    int i,j,N,indexOfMin;
    do
        {cout<<"N(1.."<<MaxN<<")=";cin>>N;}
    while(N<1||N>MaxN);
    for(i=0;i<N;i++)
    {
        cout<<"A["<<i<<"]=";cin>>A[i];AS[i]=A[i];
    }
    for(i=0;i<N;i++)
    {
        indexOfMin=i;
        for(j=i+1;j<N;j++)
            if(A[j]<A[indexOfMin])
                indexOfMin=j;
        swap(A[i],A[indexOfMin]);
        B[i]=A[i];
    }
    for(i=0;i<N;i++)
        C[N-1-i]=B[i];
    for(i=0;i<N;i++)
        D[i]=B[i]+C[i];
    cout<<"A: ";
    for(i=0;i<N;i++)
        cout<<setw(8)<<AS[i]<<" ";
    cout<<endl;
    cout<<"B: ";
    for(i=0;i<N;i++)
        cout<<setw(8)<<B[i]<<" ";
    cout<<endl;
    cout<<"C: ";
    for(i=0;i<N;i++)
        cout<<setw(8)<<C[i]<<" ";
    cout<<endl;
    cout<<"D: ";
    for(i=0;i<N;i++)
        cout<<setw(8)<<D[i]<<" ";
    cout<<endl;
    return 0;
}