#include <bits/stdc++.h>
using namespace std;
char a[10][10][10];
int flag = 0;
void dfs(int x, int y, int step) {
  if (flag == 1) return;
  if (step == 8 && a[step - 1][x][y] == '.') {
    flag = 1;
    return;
  }
  if (a[step - 1][x][y] == 'S') return;
  for (int i = -1; i <= 1; i++)
    for (int j = -1; j <= 1; j++)
      if (x + i >= 1 && x + i <= 8 && y + j >= 1 && y + j <= 8 &&
          a[step - 1][x + i][y + j] != 'S')
        dfs(x + i, y + j, step + 1);
}
int main() {
  for (int i = 1; i <= 8; i++) {
    for (int j = 1; j <= 8; j++) scanf("%c", &a[0][i][j]);
    scanf("\n");
  }
  for (int k = 1; k <= 7; k++) {
    for (int i = 1; i <= 8; i++)
      for (int j = 1; j <= 8; j++)
        if (i == 1)
          a[k][i][j] = '.';
        else if (a[k - 1][i - 1][j] == 'S')
          a[k][i][j] = 'S';
        else
          a[k][i][j] = '.';
  }
  dfs(8, 1, 1);
  if (flag == 1)
    cout << "WIN" << endl;
  else
    cout << "LOSE" << endl;
  return 0;
}
