#include <bits/stdc++.h>
using namespace std;
char gr[11][11][11];
bool u[11][11][11];
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1, 0},
    dy[] = {-1, 0, 1, -1, 1, -1, 0, 1, 0};
struct p {
  int x, y, z;
  p(int x0 = 0, int y0 = 0, int z0 = 0) {
    x = x0;
    y = y0;
    z = z0;
  }
};
int main() {
  for (int i = 1; i <= 8; i++) {
    for (int j = 1; j <= 8; j++) {
      cin >> gr[i][j][1];
    }
  }
  for (int k = 2; k <= 8; k++) {
    for (int i = 1; i <= 8; i++) {
      for (int j = 1; j <= 8; j++) {
        if (gr[i - 1][j][k - 1] == 'S') {
          gr[i][j][k] = 'S';
        } else {
          gr[i][j][k] = '.';
        }
      }
    }
  }
  queue<p> q;
  q.push(p(8, 1, 1));
  u[8][1][1] = 1;
  while (!q.empty()) {
    int x = q.front().x, y = q.front().y, z = q.front().z;
    q.pop();
    for (int i = 0; i < 9; i++) {
      int nx = x + dx[i], ny = y + dy[i], nz = z + 1;
      if (nx >= 1 && nx <= 8 && ny >= 1 && ny <= 8 && gr[nx][ny][nz] != 'S' &&
          !u[nx][ny][nz] && gr[nx][ny][z] != 'S') {
        u[nx][ny][nz] = 1;
        q.push(p(nx, ny, nz));
        if (nz > 8) {
          cout << "WIN";
          return 0;
        }
      }
    }
  }
  cout << "LOSE";
  return 0;
}
