#include <bits/stdc++.h>
using namespace std;
char s[10][10];
int yd[9][2] = {0, 0, 1, 0, 1, 1, 0, 1, -1, 1, -1, 0, -1, -1, 0, -1, 1, -1},
    flag = 0;
void dfs(int m, int n, int time) {
  int i;
  if (time >= 7) {
    flag = 1;
    return;
  }
  if (flag) return;
  for (i = 0; i < 9; i++) {
    int nx, ny;
    nx = m + yd[i][0];
    ny = n + yd[i][1];
    if (nx >= 0 && nx <= 7 && ny >= 0 && ny <= 7 && s[nx - time][ny] != 'S' &&
        s[nx - time - 1][ny] != 'S') {
      dfs(nx, ny, time + 1);
    }
    if (flag) return;
  }
}
int main() {
  int i;
  while (scanf("%s", s[0]) != EOF) {
    flag = 0;
    for (i = 1; i < 8; i++) {
      scanf("%s", s[i]);
    }
    dfs(7, 0, 0);
    if (flag) {
      printf("WIN\n");
    } else {
      printf("LOSE\n");
    }
  }
  return 0;
}
