#include <bits/stdc++.h>
using namespace std;
int res = 0;
int movex[] = {0, -1, -1, -1, 0, 1, 1, 1, 0};
int movey[] = {0, -1, 0, 1, 1, 1, 0, -1, -1};
bool check(int x, int y) {
  if (x < 0 || y < 0 || x >= 8 || y >= 8) return 0;
  return 1;
}
bool dp[100][8][8] = {0};
string a[10];
int main() {
  int i, j, k;
  for (i = 0; i < 8; i++) cin >> a[i];
  queue<pair<int, pair<int, int> > > q;
  q.push(make_pair(0, make_pair(7, 0)));
  dp[0][7][0] = 1;
  while (!q.empty()) {
    int x = q.front().second.first;
    int y = q.front().second.second;
    int t = q.front().first;
    q.pop();
    if (t > 8) {
      cout << "WIN" << '\n';
      return 0;
    }
    for (i = 0; i < 9; i++) {
      int xx = x + movex[i];
      int yy = y + movey[i];
      if (check(xx, yy) && !dp[t + 1][xx][yy]) {
        if (xx - t >= 1 && a[xx - t - 1][yy] == 'S') continue;
        if (xx - t >= 0 && a[xx - t][yy] == 'S') continue;
        q.push(make_pair(t + 1, make_pair(xx, yy)));
        dp[t + 1][xx][yy] = 1;
      }
    }
  }
  cout << "LOSE" << '\n';
  return 0;
}
