#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
//#pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*
 *
 * notes:
 *
 * int64_t
 * stoi(string s) -> string to int
 * to_string() -> int (or else) to string
 *
 * vector declaration:
 * vector<ll> v(n, 0)
 * vector<vector<ll>> v(n, vector<ll>(n, 0));
 *
 * {if statement} ? {truth value} : {false value}
 *
 * set lower bound/upper bound:
 * 	// . . . m1 . . . d . . . . m2
 *    auto m1_it = b.lower_bound(d);
 *    advance(m1_it, -1);
 *    m1 = *m1_it;
 *	m2 = *b.upper_bound(d);
 *
 * #ifdef LOCAL
 *    freopen("in.txt","r",stdin);
 *    freopen("out.txt","w",stdout);
 * #endif
 *
 * constexpr auto lcm(auto x, auto... xs)
 * {
 *	return ((x = std::lcm(x, xs)), ...);
 * }
 *
 * std::gcd(int a, int b)
 *
 * cout << setprecision(n);
 *
 * set with custom ordering
 * set<ll, decltype(&cmp)> qu(cmp);
 *
 */

typedef int64_t ll;

bool ins(ll i, ll j, ll n, ll m) {

    if(i < 0 || j < 0 || i >= n || j >= m) {
        return false;
    }
    return true;

}

void solve() {

    vector<string> v(8, "");
    ll n = 8;
    for(ll i = 0; i < n; i++) {
        cin >> v[i];
    }

    //cerr << "\nv=" << v;

    vector<pair<ll,ll>> dir = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
    
    ll smod = -1;
    ll vmod = -1;

    for(ll i = 0; i < n; i++) {
        for(ll j = 0; j < n; j++) {
            
            if(v[i][j] == 'F') {
                continue;
            }

            if(v[i][j] == 'S') {
                if(smod == -1) {
                    smod = (i + j) % 2;
                    vmod = 1 - smod;
                }else{
                    if(smod != (i + j) % 2) {
                        cout << "LEHETETLEN";
                        return;
                    }
                }
            }
            if(v[i][j] == 'V') {
                if(vmod == -1) {
                    vmod = (i + j) % 2;
                    smod = 1 - vmod;
                }else{
                    if(vmod != (i + j) % 2) {
                        cout << "LEHETETLEN";
                        return;
                    }
                }
            }

            for(const auto & [di, dj] : dir) {

                if(ins(i + di, j + dj, n, n) && v[i + di][j + dj] == v[i][j])
                {
                    cout << "LEHETETLEN";
                    return;
                }
            }

        }
    }

    cout << "LEHETSEGES";

}

int main()
{
    std::ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);

    solve();

    return 0;
}