#include <bits/stdc++.h>
using namespace std;
const int maxN = 8 + 10;
int n = 8;
int a[maxN][maxN];
pair<int, int> anna, maria;
vector<pair<int, int> > s;
int f[maxN][maxN][maxN * maxN];
vector<pair<int, pair<int, int> > > q;
bool bfs(pair<int, int> m) {
  q.push_back(make_pair(0, m));
  f[m.first][m.second][0] = 1;
  for (int k = 0, l = 0; k < q.size(); l++) {
    for (; k < q.size() && q[k].first == l; k++) {
      int x = q[k].second.first, y = q[k].second.second;
      for (int xx = max(0, x - 1); xx < min(x + 2, n); xx++)
        for (int yy = max(0, y - 1); yy < min(y + 2, n); yy++)
          if (!f[xx][yy][l + 1]) {
            int valid = 1;
            for (int i = 0; i < s.size(); i++)
              if (s[i] == pair<int, int>(xx, yy) ||
                  (xx == s[i].first + 1 && yy == s[i].second))
                valid = 0;
            if (valid == 1) {
              if (pair<int, int>(xx, yy) == anna) return 1;
              f[xx][yy][l + 1] = 1;
              q.push_back(make_pair(l + 1, pair<int, int>(xx, yy)));
            }
          }
    }
    for (int i = 0; i < s.size(); i++) s[i].first++;
  }
  return 0;
}
int main() {
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) {
      char x;
      cin >> x;
      if (x == 'S') s.push_back(pair<int, int>(i, j));
    }
  anna = pair<int, int>(0, 7);
  maria = pair<int, int>(7, 0);
  cout << (bfs(maria) ? "WIN" : "LOSE") << endl;
  return 0;
}
