#include <bits/stdc++.h>
using namespace std;
struct T {
  int x, y;
} p[70];
int f, l,
    d[9][2] = {1, 0, -1, 0, 0, 1, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1, 0, 0};
void dfs(int x, int y, int g) {
  int i, a, b;
  if (x == -1 || x == 8 || y == -1 || y == 8) return;
  if ((x == 0 && y == 7) || !g || f) {
    f = 1;
    return;
  }
  for (i = 0; i < l; i++)
    if (p[i].y == y && (p[i].x == x || p[i].x + 1 == x)) return;
  for (i = 0; i < l; i++) {
    p[i].x++;
    if (p[i].x == 8) g--;
  }
  for (i = 0; i < 9; i++) {
    a = x + d[i][0];
    b = y + d[i][1];
    dfs(a, b, g);
  }
  for (i = 0; i < l; i++) p[i].x--;
}
int main() {
  int i, j, g, a, b, x, y;
  char s[10];
  f = l = 0;
  for (i = 0; i < 8; i++) {
    scanf("%s", s);
    for (j = 0; j < 8; j++)
      if (s[j] == 'S') p[l].x = i, p[l++].y = j;
  }
  g = l;
  x = 7, y = 0;
  for (i = 0; i < 9; i++) {
    a = x + d[i][0];
    b = y + d[i][1];
    dfs(a, b, g);
  }
  if (f)
    printf("WIN\n");
  else
    printf("LOSE\n");
  return 0;
}
