#include <bits/stdc++.h>
using namespace std;
const int mf[9] = {0, 0, 0, 1, 1, 1, -1, -1, -1},
          mc[9] = {0, -1, 1, 0, -1, 1, 0, -1, 1};
int dp[10][10][5000];
char t[10][10];
bool valid(int f, int c, int k) {
  if (f < 1 || f > 8 || c < 1 || c > 8) return 0;
  int fl = 1;
  for (int i = 1; i <= 8; i++)
    if (t[i][c] == 'S' && (i + k == f || i + k - 1 == f)) fl = 0;
  return fl;
}
int main() {
  for (int i = 1; i <= 8; i++) scanf("%s", t[i] + 1);
  dp[8][1][0] = 1;
  for (int k = 1; k < 5000; k++) {
    for (int i = 1; i <= 8; i++) {
      for (int j = 1; j <= 8; j++) {
        if (dp[i][j][k - 1] == 0) continue;
        for (int l = 0; l < 9; l++) {
          int nf = i + mf[l];
          int nc = j + mc[l];
          if (valid(nf, nc, k)) dp[nf][nc][k] = 1;
        }
      }
    }
    if (dp[1][8][k] == 1) {
      printf("WIN");
      return 0;
    }
  }
  printf("LOSE");
  return 0;
}
