#include <bits/stdc++.h>
using namespace std;
int dir[9][2] = {0, 0, 0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};
char s[10][10];
bool vis[11][11][11];
struct node {
  int t, x, y;
} now, st;
queue<node> q;
bool bfs() {
  int t, x, y, i, x1, y1;
  while (!q.empty()) {
    st = q.front();
    q.pop();
    t = st.t;
    x = st.x;
    y = st.y;
    if (t >= 8) return true;
    now.t = st.t + 1;
    for (i = 0; i < 9; i++) {
      now.x = x + dir[i][0];
      now.y = y + dir[i][1];
      if (now.x >= 8 || now.x < 0 || now.y >= 8 || now.y < 0) continue;
      if (now.x > t && s[now.x - t - 1][now.y] == 'S') continue;
      if (s[now.x - t][now.y] == 'S') continue;
      if (vis[t + 1][now.x][now.y]) continue;
      vis[t + 1][now.x][now.y] = 1;
      q.push(now);
    }
  }
  return false;
}
int main() {
  int i;
  for (i = 0; i < 8; i++) scanf("%s", s[i]);
  st.t = 0;
  st.x = 7;
  st.y = 0;
  q.push(st);
  puts(bfs() ? "WIN" : "LOSE");
  return 0;
}
