#include <bits/stdc++.h>
using namespace std;
char g[8][9];
bool vis[8][8][1 << 10];
int dr[] = {0, 0, 0, 1, 1, 1, -1, -1, -1};
int dc[] = {0, 1, -1, 0, 1, -1, 0, 1, -1};
class state {
 public:
  int r, c, cost;
  state(int a, int b, int x) {
    r = a;
    c = b;
    cost = x;
  }
};
bool BFS() {
  queue<state> q;
  q.push(state(7, 0, 0));
  vis[7][0][0] = 1;
  while (!q.empty()) {
    state src = q.front();
    q.pop();
    if (src.r == 0 && src.c == 7) return 1;
    for (int i = 0; i < 9; ++i) {
      int nr = dr[i] + src.r;
      int nc = dc[i] + src.c;
      if (nr < 0 || nc < 0 || nr == 8 || nc == 8) continue;
      int ncost = src.cost + 1;
      int Sr = nr - ncost;
      int SSr = nr - src.cost;
      if (!vis[nr][nc][ncost] && (Sr < 0 || g[Sr][nc] != 'S') &&
          (SSr < 0 || g[SSr][nc] != 'S')) {
        vis[nr][nc][ncost] = 1;
        q.push(state(nr, nc, ncost));
      }
    }
  }
  return 0;
}
int main() {
  for (int i = 0; i < 8; ++i) scanf("%s", g[i]);
  if (BFS())
    puts("WIN");
  else
    puts("LOSE");
  cin >> g[0][0];
}
