#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
char g[8][9];
bool used[8][8][128];
set<pair<int, int> > s;
void solution() {
  for (int i = 0, _n = (8); i < _n; ++i) gets(g[i]);
  for (int i = 0, _n = (8); i < _n; ++i)
    for (int j = 0, _n = (8); j < _n; ++j)
      if (g[i][j] == 'S') s.insert(pair<int, int>(i, j));
  used[0][0][0] = true;
  queue<int> q;
  q.push(7);
  q.push(0);
  q.push(0);
  while (!q.empty()) {
    int i = q.front();
    q.pop();
    int j = q.front();
    q.pop();
    int t = q.front();
    q.pop();
    for (int di = -1; di <= 1; di++)
      for (int dj = -1; dj <= 1; dj++) {
        int i2 = i + di;
        int j2 = j + dj;
        if (i2 >= 0 && i2 < 8 && j2 >= 0 && j2 < 8 && !used[i2][j2][t + 1] &&
            s.find(pair<int, int>(i2 - t - 1, j2)) == s.end() &&
            s.find(pair<int, int>(i2 - t, j2)) == s.end()) {
          used[i2][j2][t + 1] = true;
          q.push(i2);
          q.push(j2);
          q.push(t + 1);
          if (i2 == 0 && j2 == 7) {
            puts("WIN");
            return;
          }
        }
      }
  }
  puts("LOSE");
}
int main() {
  solution();
  return 0;
}
