#include <bits/stdc++.h>
using namespace std;
int const N = 8;
char a[N][N + 1];
int d[N * N][N][N];
inline int in(int x) { return x >= 0 && x < N; }
int main() {
  for (int i = 0; i < N; ++i) scanf("%s", a[i]);
  for (int i = 0; i < N; ++i)
    for (int j = 0; j < N; ++j) d[0][i][j] = (a[i][j] == 'M');
  for (int i = 0; i + 1 < N * N; ++i) {
    for (int j = 0; j < N; ++j)
      for (int k = 0; k < N; ++k) {
        if (a[j][k] == 'A' && d[i][j][k]) {
          cout << "WIN\n";
          return 0;
        }
        if (a[j][k] == 'S' && in(j + i)) d[i][j + i][k] = 0;
      }
    for (int j = 0; j < N; ++j)
      for (int k = 0; k < N; ++k)
        if (d[i][j][k])
          for (int dx = -1; dx <= 1; ++dx)
            for (int dy = -1; dy <= 1; ++dy)
              if (in(j + dx) && in(k + dy) &&
                  (!in(j + dx - i) || a[j + dx - i][k + dy] != 'S'))
                d[i + 1][j + dx][k + dy] = 1;
  }
  printf("LOSE\n");
  return 0;
}
