#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    vector<string> v(8);
    for (auto &&i : v) cin >> i;
    for (int i = 0; i < 3; ++i) {
        cout << 90*(i+1) << "\n";
        auto vv = v;
        for (int j = 0; j < 8; ++j) {
            for (int k = 0; k < 8; ++k) {
                vv[j][k] = v[7-k][j];
            }
        }
        for (auto &&l : vv) {
            cout << l << "\n";
        }
        v = vv;
    }
    return 0;
}
