#include <bits/stdc++.h>
using namespace std;
char a[10][10];
int Q[555555];
int d[10][10][10];
int dx[9] = {1, 1, 1, 0, 0, 0, -1, -1, -1},
    dy[9] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
int valid(int x, int y, int t) {
  if (x >= 0 && x < 8 && y >= 0 && y < 8) {
    if (x - t < 0) return 1;
    if (a[x - t][y] != 'S' && (x - t - 1 < 0 || a[x - t - 1][y] != 'S'))
      return 1;
  }
  return 0;
}
int main(void) {
  for (int i = 0; i < 8; i++) scanf("%s", a[i]);
  Q[0] = 7;
  Q[1] = 0;
  Q[2] = 0;
  d[0][7][0] = 1;
  int qe = 3, qb = 0, ok = 0;
  while (qb < qe) {
    int x = Q[qb++], y = Q[qb++], t = Q[qb++];
    if (t > 8) {
      ok = 1;
      break;
    }
    for (int i = 0; i < 9; i++) {
      if (valid(x + dx[i], y + dy[i], t) &&
          d[t + 1][x + dx[i]][y + dy[i]] == 0) {
        d[t + 1][x + dx[i]][y + dy[i]] = 1;
        Q[qe++] = x + dx[i];
        Q[qe++] = y + dy[i];
        Q[qe++] = t + 1;
      }
    }
  }
  puts(ok ? "WIN" : "LOSE");
  return 0;
}
