#include <bits/stdc++.h>
using namespace std;
int k[10][10];
int a[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
int b[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
bool ans = false;
void dfs(int x, int y, int s) {
  if (s == 8) ans = true;
  for (int i = 0; i < 9 && !ans; i++) {
    int fx = x + a[i], fy = y + b[i];
    if (fx > 8 || fy > 8 || fx < 1 || fy < 1 || k[fx - s - 1][fy] ||
        k[fx - s][fy])
      continue;
    dfs(fx, fy, s + 1);
  }
}
int main() {
  int i, j;
  char r;
  for (i = 1; i <= 8; i++)
    for (j = 1; j <= 8; j++) {
      cin >> r;
      if (r == '.' || r == 'M' || r == 'A') k[i][j] = 0;
      if (r == 'S') k[i][j] = 1;
    }
  dfs(8, 1, 0);
  if (ans)
    cout << "WIN";
  else
    cout << "LOSE";
}
