#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10, mod = 1e9 + 7;
string arr[8];
int dd[30][10][10], visited[30][10][10];
;
int dr[] = {0, 1, 1, 0, -1, -1, -1, 0, 1};
int dc[] = {0, 0, -1, -1, -1, 0, 1, 1, 1};
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  for (int i = 0; i < 8; i++) cin >> arr[i];
  memset(dd, 1, sizeof dd);
  for (int i = 0; i < 8; i++)
    for (int j = 0; j < 8; j++)
      if (arr[i][j] == 'S')
        for (int k = 0; k <= 8; k++) dd[k][i + k][j] = false;
  queue<pair<int, pair<int, int> > > q;
  q.push({0, {7, 0}});
  while (!q.empty()) {
    auto a = q.front();
    q.pop();
    int step = a.first, x = a.second.first, y = a.second.second;
    if (x == 0 && y == 7) {
      cout << "WIN";
      return 0;
    }
    if (step > 20) continue;
    if (!dd[step][x][y] || visited[step][x][y]) continue;
    visited[step][x][y] = 1;
    for (int i = 0; i <= 8; i++) {
      int _x = x + dr[i], _y = y + dc[i];
      if (_x < 0 || _x >= 8 || _y < 0 || _y >= 8) continue;
      int f = dd[step][_x][_y];
      if (f) q.push({step + 1, {_x, _y}});
    }
  }
  cout << "LOSE";
}
