#include <iostream>
#include <vector>

using namespace std;

void Sort(vector<int> &mas, int size)
{
    int temp,item;
    for (int i = 1; i < size; i++)
    {
        temp = mas[i];
        item = i-1;
        while(item >= 0 && mas[item] > temp)
        {
            mas[item + 1] = mas[item];
            mas[item] = temp;
            item--;
        }
    }
}



int main()
{
    int a = 4;
    int matr[a][a];
    vector<int> mas;

    for (int i = 0; i < a; i++)
    {
        for (int j = 0; j < a; j++)
        {
            cin >> matr[i][j];
        }
    }
    cout << endl;
    int i;
    int j = 1;
    int b = 0;
    int k = 1;
    int g,p;
    while (j != a/2)
    {
        i = a/2 + b;
        while (i != (a/2 - 2 - b))
        {
               mas.push_back(matr[i][j]);
               i--;
        }

        Sort(mas,mas.size());
        for (int z = 0; z < mas.size(); z++)
        {
            cout << mas[z] << " ";
        }
        cout << endl;
        p = 0;
        g = a/2 + b;
        while (g != (a/2 - 2 - b))
        {
            matr[g][j] = mas[p];
            p++;
            g--;
        }
        cout << endl;
        mas.clear();
        j++;
        b++;
    }

    cout << endl;


    b = 0;
    while (j != a-1)
    {
        i = 1 + b;
        while (i != (a - 1) - b)
        {
            mas.push_back(matr[i][j]);
            i++;
        }
        Sort(mas,mas.size());

        for (int z = 0; z < mas.size(); z++)
        {
            cout << mas[z] << " ";
        }
        cout << endl;
        p = mas.size();
        g = 1 + b;
        while (g != (a - 1) - b)
        {
            matr[g][j] = mas[p - 1];
            p--;
            g++;
        }

        mas.clear();
        j++;
        b++;

    }
    cout << endl;




    for (int i = 0; i < a; i++)
    {
        for (int j = 0; j < a; j++)
        {
            cout << matr[i][j] << " ";
        }
        cout << endl;
    }




}