#include <bits/stdc++.h>
using namespace std;
bool ok(int x, int y) { return (x >= 0 && y >= 0 && x < 8 && y < 8); }
vector<pair<int, int> > r;
int dx[9] = {1, 1, 1, 0, 0, -1, -1, -1, 0};
int dy[9] = {1, 0, -1, 1, -1, -1, 0, 1, 0};
bool ans;
pair<int, int> t;
void dfs(int x, int y, int k) {
  if (x == 0 && y == 7) {
    ans = true;
    return;
  }
  bool bx2 = 0;
  for (int i = (0); i < (int((r).size())); ++i) {
    if (ok(r[i].first + k, r[i].second)) {
      bx2 = true;
      break;
    }
  }
  if (!bx2) {
    ans = 1;
    return;
  }
  for (int i = (0); i < (9); ++i) {
    t = make_pair(x, y);
    t.first += dx[i];
    t.second += dy[i];
    if (!ok(t.first, t.second)) continue;
    bool bx = true;
    for (int j = (0); j < (int((r).size())); ++j) {
      if ((t.first == r[j].first + k + 1 && t.second == r[j].second) ||
          (t.first == r[j].first + k && t.second == r[j].second)) {
        bx = false;
        break;
      }
    }
    if (bx) dfs(t.first, t.second, k + 1);
  }
}
int main() {
  vector<string> s(8);
  for (int i = (0); i < (8); ++i) cin >> s[i];
  ans = false;
  for (int i = (0); i < (8); ++i) {
    for (int j = (0); j < (8); ++j) {
      if (s[i][j] == 'S') {
        r.push_back(make_pair(i, j));
      }
    }
  }
  dfs(7, 0, 0);
  if (ans) {
    cout << "WIN\n";
  } else
    cout << "LOSE\n";
  return 0;
}
