#include <bits/stdc++.h>
using namespace std;
const int N = 10;
const int n = 8;
const int fx[] = {0, 0, 1, -1, 1, 1, -1, -1, 0};
const int fy[] = {1, -1, 0, 0, 1, -1, 1, -1, 0};
int o;
int bx[N * N], by[N * N];
int f[105][N][N];
char a[N][N];
int check(int t, int x, int y) {
  if (x < 1 || x > n || y < 1 || y > n) return 0;
  for (int i = 0; i < o; ++i)
    if ((bx[i] + t == x && by[i] == y)) return 0;
  return 1;
}
int main() {
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      scanf("%c", &a[i][j]);
      if (a[i][j] == 'S') bx[o] = i, by[o++] = j;
    }
    scanf("\n");
  }
  f[0][8][1] = 1;
  for (int i = 0; i <= 100; ++i) {
    if (f[i][1][n]) {
      puts("WIN");
      return 0;
    }
    for (int j = 1; j <= n; ++j)
      for (int k = 1; k <= n; ++k)
        if (f[i][j][k])
          for (int l = 0; l <= 9; ++l)
            if (check(i, j + fx[l], k + fy[l]) &&
                check(i + 1, j + fx[l], k + fy[l]))
              f[i + 1][j + fx[l]][k + fy[l]] = 1;
  }
  puts("LOSE");
  return 0;
}
