#include <bits/stdc++.h>
using namespace std;
int N = 8;
char dolu[10][10][10 * 10], used[10][10][10 * 10], ar[10][10];
int yon[9][2] = {{-1, 0}, {0, 1},  {1, 0},   {0, -1}, {-1, 1},
                 {1, 1},  {1, -1}, {-1, -1}, {0, 0}};
void bfs() {
  int x = 8, y = 1, q[10 * 10 * 10 * 10][3], m, n;
  int at = 0, al = 0;
  q[++at][0] = x;
  q[at][1] = y;
  q[at][2] = 1;
  used[x][y][1] = 1;
  while (at != al) {
    x = q[++al][0];
    y = q[al][1];
    if (x == 1 && y == 8) {
      printf("WIN\n");
      return;
    }
    for (int k = 0; k < 9; k++) {
      m = x + yon[k][0];
      n = y + yon[k][1];
      if (m > 0 && n > 0 && m <= N && n <= N && !dolu[m][n][q[al][2]] &&
          !dolu[m][n][q[al][2] + 1] && !used[m][n][q[al][2] + 1]) {
        q[++at][0] = m;
        q[at][1] = n;
        q[at][2] = q[al][2] + 1;
        used[m][n][q[al][2] + 1] = 1;
      }
    }
  }
  printf("LOSE\n");
}
int main() {
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= N; j++) {
      scanf(" %c", &ar[i][j]);
      if (ar[i][j] == 'S') {
        for (int k = i; k <= N; k++) dolu[k][j][k - i + 1] = 1;
      }
    }
  bfs();
}
