#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
clock_t clk = clock();
long long int i, j;
void solve(void);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t = 1;
  while (t--) solve();
  return 0;
}
string s[8];
bool vis[8][8];
int dy[9] = {-1, 0, 1, 1, 1, 0, -1, -1, 0},
    dx[9] = {-1, -1, -1, 0, 1, 1, 1, 0, 0};
bool compute(int x, int y, int m) {
  if (s[x][y] == 'A') return 1;
  if (x - m >= 0 && s[x - m][y] == 'S') return 0;
  bool pos = 0;
  int k;
  for (k = 0; k <= 8; ++k)
    if (x + dx[k] >= 0 && x + dx[k] < 8 && y + dy[k] >= 0 && y + dy[k] < 8)
      if (vis[x + dx[k]][y + dy[k]] == 0)
        if ((x + dx[k] - m >= 0 && s[x + dx[k] - m][y + dy[k]] != 'S') ||
            x + dx[k] - m < 0) {
          pos = pos | compute(x + dx[k], y + dy[k], m + 1);
          if (pos == 1) return 1;
        }
  return pos;
}
void solve() {
  for (i = 0; i <= 7; ++i) cin >> s[i];
  bool ans = compute(7, 0, 0);
  if (ans == 1)
    cout << "WIN\n";
  else
    cout << "LOSE\n";
}
