#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-9;
const int inf = 1e+9;
const double pi = acos(-1.0);
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long xabs(long long a) { return a > 0 ? a : -a; }
map<int, vector<string>> s;
int sm[9][2] = {{0, 1},  {0, -1}, {1, 0},   {-1, 0}, {1, 1},
                {1, -1}, {-1, 1}, {-1, -1}, {0, 0}};
void dfs(int x, int y, int t) {
  if (t == 9) {
    cout << "WIN";
    exit(0);
  }
  if (s[t][x][y] == 'S') return;
  for (int i = 0; i < 9; i++) {
    int xx = x + sm[i][0];
    int yy = y + sm[i][1];
    if (xx >= 0 && xx < 8 && yy >= 0 && yy < 8 && s[t][xx][yy] != 'S')
      dfs(xx, yy, t + 1);
  }
}
int main() {
  for (int i = 0; i < 8; i++) {
    string t;
    cin >> t;
    s[0].push_back(t);
  }
  for (int i = 1; i <= 8; i++) {
    string r = "........";
    s[i].push_back(r);
    for (int k = 0; k < 7; k++) {
      s[i].push_back(s[i - 1][k]);
    }
  }
  dfs(7, 0, 0);
  cout << "LOSE";
  return 0;
}
