#include <bits/stdc++.h>
using namespace std;
char mp[10][10];
int stx, sty, enx, eny;
int mem[10][10][30];
int dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
bool isIn(int x, int y) { return x >= 0 && y >= 0 && x < 8 && y < 8; }
int solve(int x, int y, int cur) {
  if (x == enx && y == eny) return 1;
  if (cur == 30) return 0;
  int& res = mem[x][y][cur];
  if (res != -1) return res;
  res = 0;
  for (int i = -1; i <= 1; i++) {
    for (int j = -1; j <= 1; j++) {
      int nx = x + i;
      int ny = y + j;
      if (isIn(nx, ny) && (nx - cur < 0 || mp[nx - cur][ny] != 'S') &&
          (nx - cur - 1 < 0 || mp[nx - cur - 1][ny] != 'S') &&
          solve(nx, ny, cur + 1))
        res = 1;
    }
  }
  return res;
}
int main() {
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      cin >> mp[i][j];
      if (mp[i][j] == 'M') stx = i, sty = j, mp[i][j] = '.';
      if (mp[i][j] == 'A') enx = i, eny = j, mp[i][j] = '.';
    }
  }
  memset(mem, -1, sizeof mem);
  int res = solve(stx, sty, 0);
  cout << (res == 1 ? "WIN" : "LOSE") << endl;
  return 0;
}
