#include <bits/stdc++.h>
using namespace std;
char a[111][11][11];
bool visited[111][11][11];
bool bfs() {
  memset(visited, false, sizeof visited);
  visited[0][8][1] = true;
  queue<pair<int, pair<int, int> > > qu;
  qu.push(make_pair(0, make_pair(8, 1)));
  while (!qu.empty()) {
    int t = qu.front().first, u = qu.front().second.first,
        v = qu.front().second.second;
    qu.pop();
    if (u == 1 && v == 8) return true;
    if (t == 30) continue;
    for (int di = (-1), _b = (1); di <= _b; di++)
      for (int dj = (-1), _b = (1); dj <= _b; dj++) {
        int uu = u + di, vv = v + dj;
        if (uu < 1 || uu > 8 || vv < 1 || vv > 8) continue;
        if (a[t][uu][vv] == 'S' || a[t + 1][uu][vv] == 'S') continue;
        if (visited[t + 1][uu][vv]) continue;
        visited[t + 1][uu][vv] = true;
        qu.push(make_pair(t + 1, make_pair(uu, vv)));
      }
  }
  return false;
}
int main() {
  ios ::sync_with_stdio(false);
  while (cin >> a[0][1][1]) {
    for (int i = (1), _b = (8); i <= _b; i++)
      for (int j = (1), _b = (8); j <= _b; j++)
        if (i > 1 || j > 1) cin >> a[0][i][j];
    a[0][1][8] = a[0][8][1] = '.';
    for (int time = (1), _b = (32); time <= _b; time++) {
      for (int i = (1), _b = (8); i <= _b; i++)
        for (int j = (1), _b = (8); j <= _b; j++) {
          if (i == 1)
            a[time][i][j] = '.';
          else
            a[time][i][j] = a[time - 1][i - 1][j];
        }
    }
    cout << (bfs() ? "WIN" : "LOSE") << endl;
  }
  return 0;
}
