#include <bits/stdc++.h>
using namespace std;
const long long N = 10;
char a[N][N];
bool done;
void dfs(long long x, long long y, long long k) {
  if (done) return;
  if (k > 6) {
    done = true;
    return;
  }
  for (long long i = -1; i < 2; i++) {
    for (long long j = -1; j < 2; j++) {
      long long movex = x + i;
      long long movey = y + j;
      if (movex < 0 || movex > 7) continue;
      if (movey < 0 || movey > 7) continue;
      if (movex >= k && a[movex - k][movey] == 'S') continue;
      if (movex >= k - 1 && a[movex - k - 1][movey] == 'S') continue;
      dfs(movex, movey, k + 1);
    }
  }
  return;
}
int main() {
  long long i, j;
  for (i = 0; i < 8; i++)
    for (j = 0; j < 8; j++) cin >> a[i][j];
  dfs(7, 0, 0);
  if (done)
    cout << "WIN\n";
  else
    cout << "LOSE\n";
  return 0;
}
