#include <bits/stdc++.h>
using namespace std;
const int a[] = {0, -1, -1, -1, 0, 0, 0, 1, 1, 1},
          b[] = {0, -1, 0, 1, -1, 0, 1, -1, 0, 1};
int k[15][15];
char ch;
int Dfs(int x, int y, int s) {
  if (s == 8) return 1;
  for (int i = 1; i <= 9; i++) {
    int p = x + a[i], q = y + b[i];
    if (p > 8 || q > 8 || p < 1 || q < 1 || k[p - s - 1][q] || k[p - s][q])
      continue;
    if (Dfs(p, q, s + 1)) return 1;
  }
  return 0;
}
int main() {
  for (int i = 1; i <= 8; i++)
    for (int j = 1; j <= 8; j++) cin >> ch, k[i][j] = (ch == 'S');
  puts(Dfs(8, 1, 0) ? "WIN" : "LOSE");
  return 0;
}
