#include <bits/stdc++.h>
int k[28][28];
char s[10][10], s1[10][10][10];
int gm(int a, int b, int c) {
  if (a < 1 || a > 8) return 0;
  if (b < 0 || b > 7) return 0;
  if (s1[c - 1][a][b] == 'S') return 0;
  int i, j;
  memset(s1[c], 0, sizeof(s1[c]));
  for (i = 1; i <= 8; ++i) {
    if (c > 1) {
      if (i > 1) {
        for (j = 0; j < 8; ++j) {
          s1[c][i][j] = s1[c - 1][i - 1][j];
        }
      }
    } else {
      for (j = 0; j < 8; ++j) {
        s1[c][i][j] = s[i][j];
      }
    }
  }
  if (c >= 9) return 1;
  if (s1[c][a][b] == 'S') return 0;
  if (gm(a, b, c + 1) == 1) return 1;
  if (gm(a + 1, b, c + 1) == 1) return 1;
  if (gm(a, b + 1, c + 1) == 1) return 1;
  if (gm(a - 1, b, c + 1) == 1) return 1;
  if (gm(a, b - 1, c + 1) == 1) return 1;
  if (gm(a + 1, b + 1, c + 1) == 1) return 1;
  if (gm(a - 1, b + 1, c + 1) == 1) return 1;
  if (gm(a + 1, b - 1, c + 1) == 1) return 1;
  if (gm(a - 1, b - 1, c + 1) == 1) return 1;
  return 0;
}
int main() {
  int k2[28], k3[28];
  int a, b, c, d, e, f, g, i, j, n, m, t, j1, t1;
  for (i = 1; i <= 8; ++i) {
    scanf("%s", &s[i]);
  }
  memset(s1, 0, sizeof(s1));
  if (gm(8, 0, 1) == 1)
    printf("WIN\n");
  else
    printf("LOSE\n");
  return 0;
}
