#include <bits/stdc++.h>
using namespace std;
char a[9][9];
int ax, ay, mx, my;
int s[9][9];
bool check(int x, int y, int t) {
  if (x >= 0 && x < 8 && y >= 0 && y < 8 && (t > x || !s[x - t][y]))
    return true;
  return false;
}
bool dfs(int x, int y, int t, int num) {
  if (a[x][y] == 'A') return true;
  if (t <= x && s[x - t][y]) return false;
  if (t >= 8) return true;
  if (t > 0 && t < 8) {
    for (int i = 0; i < 8; i++) {
      if (s[8 - t][i]) num -= s[x - t][i];
    }
  }
  if (num <= 0) return true;
  for (int i = -1; i < 2; ++i) {
    for (int j = -1; j < 2; ++j) {
      if (check(x + i, y + j, t) && dfs(x + i, y + j, t + 1, num)) return true;
    }
  }
  return false;
}
int main() {
  int num = 0;
  for (int i = 0; i < 8; ++i) scanf("%s", a[i]);
  memset(s, 0, sizeof(s));
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; ++j) {
      if (a[i][j] == 'M') {
        mx = i;
        my = j;
      }
      if (a[i][j] == 'S') {
        s[i][j]++;
        num++;
      }
    }
  }
  if (num == 0 || dfs(mx, my, 0, num))
    printf("WIN");
  else
    printf("LOSE");
}
