#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int n;
bool safe[15][10][10];
char mp[15][15];
bool dfs(int d, int x, int y) {
  int i, j, tx, ty;
  int de[9][2] = {0, 0, 1, 0, 0, 1, -1, 0, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};
  if (d == 8 || x == 1 && y == 8) return 1;
  for (i = 0; i < 9; i++) {
    tx = x + de[i][0];
    ty = y + de[i][1];
    if (tx <= 0 || ty <= 0 || tx > 8 || ty > 8) continue;
    if (!safe[d + 1][tx][ty]) continue;
    if (dfs(d + 1, tx, ty)) return 1;
  }
  return 0;
}
int main() {
  int t, i, j, k, tmp;
  for (i = 1; i <= 8; i++) {
    scanf("%s", mp[i] + 1);
    for (j = 1; j <= 8; j++) safe[1][i][j] = (mp[i][j] != 'S');
  }
  for (k = 2; k <= 8; k++) {
    for (i = 1; i <= 8; i++) {
      for (j = 1; j <= 8; j++) {
        if (i - (k - 1) > 0 && mp[i - (k - 1)][j] == 'S')
          safe[k][i][j] = 0;
        else if (i - (k - 2) > 0 && mp[i - (k - 2)][j] == 'S')
          safe[k][i][j] = 0;
        else
          safe[k][i][j] = 1;
      }
    }
  }
  if (dfs(1, 8, 1))
    puts("WIN");
  else
    puts("LOSE");
  return 0;
}
