#include <bits/stdc++.h>
using namespace std;
string s[8];
set<vector<long long> > st;
long long dp[8][8][10000];
bool win(long long x, long long y, long long c) {
  if (c >= 8) return true;
  if (x >= 8 || y < 0 || x < 0 || y >= 8) {
    return false;
  }
  if (dp[x][y][c] != -1) {
    return dp[x][y][c];
  }
  if (s[x][y] == 'A') {
    return true;
  }
  bool r = false;
  if (st.count({x - c, y})) {
    return false;
  }
  for (long long i = -1; i <= 1; ++i) {
    for (long long j = -1; j <= 1; ++j) {
      if (st.count({x + i - c, y + j}) == 0) r = r || win(x + i, y + j, c + 1);
    }
  }
  return dp[x][y][c] = r;
}
void solve() {
  memset(dp, -1, sizeof(dp));
  for (long long i = 0; i < 8; ++i) {
    cin >> s[i];
  }
  for (long long i = 0; i < 8; ++i) {
    for (long long j = 0; j < 8; ++j) {
      if (s[i][j] == 'S') {
        st.insert({i, j});
      }
    }
  }
  if (win(7, 0, 0)) {
    cout << "WIN\n";
  } else
    cout << "LOSE\n";
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
