#include <map>
    #include <set>
    #include <list>
    #include <cmath>
    #include <ctime>
    #include <deque>
    #include <queue>
    #include <stack>
    #include <bitset>
    #include <cstdio>
    #include <limits>
    #include <vector>
    #include <cstdlib>
    #include <numeric>
    #include <sstream>
    #include <iostream>
    #include <algorithm>

    typedef long long ll;
    typedef unsigned long long ull;
    typedef std::vector<int> vi;
    typedef std::vector<vi> vii;
    typedef std::vector<char> vc;
    typedef std::vector<std::string> vs;

    #define REP(i,a,b)  for(int i=int(a);i<=int(b);i++)
    #define REPd(i,a,b) for(int i=int(a);i>=int(b);i--)
    #define newl std::cout<<"\n"

    int main(){
    std::string s;
    std::string a[10][10];
    int row=0,col=0,t_cols;
    while(getline(std::cin,s)){
        //std::cout<<s[2]<<"\n";
        for(int i=0;i<s.size();i++){
            std::string temp="\0";
            while(s[i]!=' '){
                temp+=s[i];
                i++;
                if(i>s.size())
                    break;
            }
            a[row][col]=temp;
            col++;
            t_cols++;
        }
        row++;col=0;
    }
    int k_row=0,k_col=0;col=t_cols/row;
    while(k_row<row&&k_col<col){
        for(int i=k_col;i<col;i++){
            std::cout<<a[k_row][i]<<" ";
        }
        k_row++;
        for(int i=k_row;i<row;i++){
            std::cout<<a[i][col-1]<<" ";
        }
        col--;
        if(k_row<row){
            for(int i=col-1;i>=1;--i)
            std::cout<<a[row-1][i]<<" ";
            row--;
        }
        if(k_col<col){
             for (int i =row-1; i >=k_row ; --i)
                std::cout<<a[i][k_col]<<" ";
               k_col++;
        }
    }
    }