#include <bits/stdc++.h>
using namespace std;
const int mxN = 8;
bool stone[mxN][mxN][mxN];
bool vis[mxN][mxN][mxN];
bool dfs(int t, int i, int j) {
  if (t == 8) return true;
  if (vis[t][i][j] || stone[t][i][j]) return false;
  vis[t][i][j] = true;
  for (int dx = -1; dx <= 1; dx++) {
    for (int dy = -1; dy <= 1; dy++) {
      int x = i + dx, y = j + dy;
      if (min(x, y) < 0 || max(x, y) >= 8 || stone[t][x][y]) continue;
      if (dfs(t + 1, x, y)) return true;
    }
  }
  return false;
}
int32_t main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      char c;
      cin >> c;
      if (c == 'S') {
        for (int ii = i; ii < 8; ii++) {
          stone[ii - i][ii][j] = true;
        }
      }
    }
  }
  cout << (dfs(0, 7, 0) ? "WIN\n" : "LOSE\n");
  return 0;
}
