#include <bits/stdc++.h>
using namespace std;
int f[72][12][12];
struct arr {
  char s[12][12];
} g[72], tmp;
int dx[12] = {0, 0, 1, 1, 1, -1, -1, -1, 0},
    dy[12] = {1, -1, 1, -1, 0, 1, -1, 0, 0};
bool Dfs(int t, int x, int y) {
  if (t > 64) return 0;
  if (x == 1 && y == 8) return 1;
  if (f[t][x][y] != -1) return f[t][x][y];
  for (int i = 0; i <= 8; i++) {
    int tx = x + dx[i], ty = y + dy[i];
    if (tx < 1 || tx > 8 || ty < 1 || ty > 8) continue;
    if (g[t].s[tx][ty] == 'S' || g[t + 1].s[tx][ty] == 'S') continue;
    if (Dfs(t + 1, tx, ty)) return f[t][x][y] = 1;
  }
  return f[t][x][y] = 0;
}
void Change() {
  for (int i = 8; i >= 1; i--)
    for (int j = 1; j <= 8; j++)
      if (tmp.s[i][j] == 'S') {
        tmp.s[i + 1][j] = 'S';
        tmp.s[i][j] = '.';
      }
}
int main() {
  for (int i = 1; i <= 8; i++) scanf("%s", &tmp.s[i][1]);
  g[0] = tmp;
  for (int i = 1; i <= 65; i++) {
    Change();
    g[i] = tmp;
  }
  memset(f, -1, sizeof(f));
  if (Dfs(0, 8, 1))
    printf("WIN");
  else
    printf("LOSE");
  return 0;
}
