#include <bits/stdc++.h>
using namespace std;
char mapa[16][16];
int foi[16][16][16];
int dl[] = {0, 0, 0, 1, 1, 1, -1, -1, -1};
int dc[] = {0, 1, -1, 0, 1, -1, 0, 1, -1};
bool valido(int l, int c) {
  if (l < 0 || c < 0) return false;
  if (l >= 8 || c >= 8) return false;
  return true;
}
bool solve(int l, int c, int p) {
  if (p == 8) return true;
  for (int i = 0; i < 9; i++) {
    if (valido(l + dl[i], c + dc[i]) && !foi[l + dl[i]][c + dc[i]][p + 1] &&
        !foi[l + dl[i]][c + dc[i]][p])
      if (solve(l + dl[i], c + dc[i], p + 1)) return true;
  }
  return false;
}
int main() {
  memset(foi, 0, sizeof(foi));
  for (int i = 0; i < 8; i++) {
    scanf(" %s", mapa[i]);
    for (int j = 0; j < 8; j++) {
      if (mapa[i][j] == 'S')
        for (int k = 0; i + k < 8; k++) foi[i + k][j][k] = 1;
    }
  }
  if (solve(7, 0, 0))
    printf("WIN\n");
  else
    printf("LOSE\n");
  return 0;
}
