#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000007);
const int INF((1 << 30) - 1);
const int MAXN();
int dp[2][10][10] = {0};
int main() {
  string a[10];
  for (int i = 0; i < 8; i++) cin >> a[i];
  int now = 1, prev = 0;
  dp[prev][7][0] = 1;
  while (1) {
    for (int i = 0; i < 8; i++)
      for (int j = 0; j < 8; j++) dp[now][i][j] = 0;
    for (int i = 0; i < 8; i++)
      for (int j = 0; j < 8; j++)
        if (dp[prev][i][j])
          for (int k = -1; k <= +1; k++)
            for (int l = -1; l <= +1; l++) {
              int x = i + k, y = j + l;
              if (x < 0 || x >= 8 || y < 0 || y >= 8) continue;
              if (a[x][y] == 'S') continue;
              dp[now][x][y] = 1;
            }
    for (int i = 7; i >= 0; i--)
      for (int j = 0; j < 8; j++)
        if (a[i][j] == 'S') {
          a[i][j] = '.';
          if (i + 1 < 8) a[i + 1][j] = 'S', dp[now][i + 1][j] = 0;
        }
    bool chk = 0;
    for (int i = 0; i < 8; i++)
      for (int j = 0; j < 8; j++)
        if (dp[now][i][j]) {
          if (a[i][j] == 'A') {
            printf("WIN");
            return 0;
          }
          chk = 1;
        }
    if (!chk) {
      printf("LOSE");
      return 0;
    }
    now = !now, prev = !prev;
  }
}
