#include <bits/stdc++.h>
using namespace std;
int vis[8][8];
char s[8][8];
const int dx[] = {0, -1, 0, 1, 1, -1, 1, -1, 0};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int bad[8][8][100];
int main() {
  int n = 8;
  for (int i = 0; i < n; ++i) scanf("%s", &s[i]);
  vis[7][7] = true;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j)
      if (s[i][j] == 'S') {
        for (int k = i; k < n; ++k) bad[k][j][k - i] = true;
      }
  queue<pair<int, int> > q, p;
  p.push(make_pair(7, 0));
  for (int t = 0; t < 100; ++t) {
    q = p, p = queue<pair<int, int> >();
    memset(vis, 0, sizeof(vis));
    while (!q.empty()) {
      int x = q.front().first, y = q.front().second;
      q.pop();
      if (bad[x][y][t]) continue;
      for (int k = 0; k < 9; ++k) {
        int a = x + dx[k], b = y + dy[k];
        if (a >= 0 && b >= 0 && a < 8 && b < 8 && !bad[a][b][t] && !vis[a][b]) {
          if (a == 0 && b == 7) {
            printf("WIN");
            return 0;
          }
          p.push(make_pair(a, b));
          vis[a][b] = true;
        }
      }
    }
  }
  printf("LOSE");
  return 0;
}
