#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()


struct Edge {
    int to, cost, nm;
    Edge(int to, int cost, int nm): to(to), cost(cost), nm(nm) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int INF = 100000000;

ll GCD(ll a, ll b){
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return GCD(b, a%b);
}

bool cmp(const pii& a, const pii& b){
    if(a.first == b.first){
        return a.second < b.second;
    }
    return a.first < b.first;
}

vector<string> matrix;
int main() {

    int n = 8;
    for(int i=0; i<8; ++i){
        string str; cin >> str;
        matrix.push_back(str);
    }

    cout << 90 << endl;
    for(int layer=0; layer < n/2; ++layer) {
        int first=layer; //It moves from the outside in.
        int last=n-1-layer; //<--This I do not understand
        for(int i=first; i<last;++i){
            int offset=i-first; //<--A bit confusing for me

            //save the top left of the matrix
            int top = matrix[first][i];

            //shift left to top;
            matrix[first][i]=matrix[last-offset][first];
            /*I understand that it needs
             last-offset so that it will go up the column in the matrix,
            and first signifies it's in the first column*/

            //shift bottom to left
            matrix[last-offset][first]=matrix[last][last-offset];
            /*I understand that it needs
            last-offset so that the number decreases and it may go up the column (first
            last-offset) and left (latter). */

            //shift right to bottom
            matrix[last][last-offset]=matrix[i][last];
            /*I understand that it i so that in the next iteration, it moves down
            the column*/



            //rightmost top corner
            matrix[i][last]=top;
        }
    }

    REP(i, 8){
        cout << matrix[i] << endl;
    }

    cout << 180 << endl;
    for(int layer=0; layer < n/2; ++layer) {
        int first=layer; //It moves from the outside in.
        int last=n-1-layer; //<--This I do not understand
        for(int i=first; i<last;++i){
            int offset=i-first; //<--A bit confusing for me

            //save the top left of the matrix
            int top = matrix[first][i];

            //shift left to top;
            matrix[first][i]=matrix[last-offset][first];
            /*I understand that it needs
             last-offset so that it will go up the column in the matrix,
            and first signifies it's in the first column*/

            //shift bottom to left
            matrix[last-offset][first]=matrix[last][last-offset];
            /*I understand that it needs
            last-offset so that the number decreases and it may go up the column (first
            last-offset) and left (latter). */

            //shift right to bottom
            matrix[last][last-offset]=matrix[i][last];
            /*I understand that it i so that in the next iteration, it moves down
            the column*/



            //rightmost top corner
            matrix[i][last]=top;
        }
    }

    REP(i, 8){
        cout << matrix[i] << endl;
    }

    cout << 270 << endl;
    for(int layer=0; layer < n/2; ++layer) {
        int first=layer; //It moves from the outside in.
        int last=n-1-layer; //<--This I do not understand
        for(int i=first; i<last;++i){
            int offset=i-first; //<--A bit confusing for me

            //save the top left of the matrix
            int top = matrix[first][i];

            //shift left to top;
            matrix[first][i]=matrix[last-offset][first];
            /*I understand that it needs
             last-offset so that it will go up the column in the matrix,
            and first signifies it's in the first column*/

            //shift bottom to left
            matrix[last-offset][first]=matrix[last][last-offset];
            /*I understand that it needs
            last-offset so that the number decreases and it may go up the column (first
            last-offset) and left (latter). */

            //shift right to bottom
            matrix[last][last-offset]=matrix[i][last];
            /*I understand that it i so that in the next iteration, it moves down
            the column*/



            //rightmost top corner
            matrix[i][last]=top;
        }
    }

    REP(i, 8){
        cout << matrix[i] << endl;
    }
    return 0;
}


Measured memory_bytes: 3136