#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y, z;
} q[4000000], now;
int v[8][8],
    d[9][2] = {0, 1, 1, 0, 0, -1, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1, 0, 0};
char mp[8][8];
void change() {
  int i, j;
  for (i = 7; i > 0; i--)
    for (j = 0; j < 8; j++) v[i][j] = v[i - 1][j];
  for (i = 0; i < 8; i++) v[0][i] = 0;
}
void bfs() {
  int l = 0, r = 0, i, step, xx, yy;
  q[r].x = 7;
  q[r].z = 0;
  q[r++].y = 0;
  step = 0;
  while (l < r) {
    now = q[l++];
    if (step != now.z) {
      change();
      step = now.z;
    }
    if (v[now.x][now.y] == 1) continue;
    for (i = 0; i < 9; i++) {
      xx = now.x + d[i][0];
      yy = now.y + d[i][1];
      if (xx == 0 && yy == 7) {
        printf("WIN\n");
        return;
      }
      if (xx >= 0 && xx < 8 && yy >= 0 && yy < 8 && !v[xx][yy]) {
        q[r].x = xx;
        q[r].y = yy;
        q[r++].z = now.z + 1;
      }
    }
  }
  printf("LOSE\n");
}
int main() {
  int i, j;
  while (~scanf("%s", mp[0])) {
    for (i = 1; i < 8; i++) scanf("%s", mp[i]);
    for (i = 0; i < 8; i++)
      for (j = 0; j < 8; j++)
        if (mp[i][j] == 'S')
          v[i][j] = 1;
        else
          v[i][j] = 0;
    bfs();
  }
}
