#include <bits/stdc++.h>
using namespace std;
char grid[9][8][10];
int rr[] = {-1, 1, 0, 0, -1, 1, 1, -1, 0};
int cc[] = {0, 0, -1, 1, -1, -1, 1, 1, 0};
struct cell {
  int r, c, cost;
};
queue<cell> q;
int main() {
  for (int i = 0; i < 8; i++) scanf("%s", grid[0][i]);
  for (int k = 1; k < 8; k++)
    for (int i = k; i < 8; i++)
      for (int j = 0; j < 8; j++) grid[k][i][j] = grid[k - 1][i - 1][j];
  cell S = {7, 0, 0};
  q.push(S);
  while (!q.empty()) {
    cell cur = q.front();
    q.pop();
    if (grid[0][cur.r][cur.c] == 'A' || cur.cost == 8) {
      printf("WIN");
      return 0;
    }
    for (int i = 0; i < 9; i++) {
      cell N = {cur.r + rr[i], cur.c + cc[i], cur.cost + 1};
      if (N.r >= 0 && N.r < 8 && N.c >= 0 && N.c < 8 &&
          grid[cur.cost][N.r][N.c] != 'S' && grid[N.cost][N.r][N.c] != 'S')
        q.push(N);
    }
  }
  printf("LOSE");
  return 0;
}
