#include <bits/stdc++.h>
using namespace std;
queue<long> q, qu;
char st[20][20];
long u, v, m, n, flag, a, b, r, c, i, j, R[] = {1, 1, 1, -1, -1, -1, 0, 0},
                                         C[] = {-1, 0, 1, -1, 0, 1, -1, 1};
int main() {
  while (gets(st[0])) {
    flag = 0;
    u = v = m = n = 0;
    n = 1;
    for (i = 1; i < 8; i++) gets(st[i]);
    for (i = 7; i >= 0; i--) {
      for (j = 7; j >= 0; j--) {
        if (st[i][j] == 'S') {
          qu.push(i);
          qu.push(j);
          v++;
        }
      }
    }
    q.push(7);
    q.push(0);
    while (!q.empty() && !flag) {
      while (n--) {
        r = q.front();
        q.pop();
        c = q.front();
        q.pop();
        if (r == 0 && c == 7) {
          flag = 1;
          break;
        }
        if (st[r][c] == 'S') continue;
        q.push(r);
        q.push(c);
        m++;
        st[r][c] = 'M';
        for (i = 0; i < 8; i++) {
          if (r + R[i] >= 0 && r + R[i] < 8 && c + C[i] >= 0 && c + C[i] < 8) {
            if (st[r + R[i]][c + C[i]] == '.' ||
                st[r + R[i]][c + C[i]] == 'A') {
              q.push(r + R[i]);
              q.push(c + C[i]);
              st[r + R[i]][c + C[i]] = 'M';
              m++;
            }
          }
        }
      }
      n = m;
      m = 0;
      while (v--) {
        a = qu.front();
        qu.pop();
        b = qu.front();
        qu.pop();
        if (a + 1 < 8) {
          qu.push(a + 1);
          qu.push(b);
          u++;
        }
        st[a + 1][b] = 'S';
        st[a][b] = '.';
      }
      v = u;
      u = 0;
    }
    if (flag)
      printf("WIN\n");
    else
      printf("LOSE\n");
    for (i = 0; i <= 8; i++) st[i][0] = 0;
    while (!q.empty()) q.pop();
    while (!qu.empty()) qu.pop();
  }
  return 0;
}
