#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const int N = 10;
char s[N][N];
vector<pair<int, int> > v;
bool valid(int y, int x, int step) {
  if (y >= 0 && y <= 7 && x >= 0 && x <= 7) {
    for (int i = 0; i <= (int)v.size() - 1; i++) {
      int py = v[i].first;
      int px = v[i].second;
      if (px == x && (py + step == y || py + step == y - 1)) return false;
    }
    return true;
  } else {
    return false;
  }
}
bool BFS() {
  queue<pair<int, pair<int, int> > > q;
  q.push({0, {7, 0}});
  while (!q.empty()) {
    pair<int, pair<int, int> > f = q.front();
    q.pop();
    int step = f.first;
    int y = f.second.first;
    int x = f.second.second;
    if (step == 8) return true;
    for (int i = -1; i <= 1; i++) {
      for (int j = -1; j <= 1; j++) {
        int py = y + i;
        int px = x + j;
        if (valid(py, px, step)) {
          q.push({step + 1, {py, px}});
        }
      }
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  for (int i = 0; i <= 7; i++) {
    for (int j = 0; j <= 7; j++) {
      cin >> s[i][j];
      if (s[i][j] == 'S') {
        v.push_back({i, j});
      }
    }
  }
  bool ans = BFS();
  if (ans)
    cout << "WIN\n";
  else
    cout << "LOSE\n";
  return 0;
}
