#include <bits/stdc++.h>
using namespace std;
int main(void) {
  vector<string> w(8);
  for (int i = 0; i < 8; ++i) {
    cin >> w[i];
  }
  set<pair<pair<int, int>, int> > s, s2;
  pair<int, int> start, finish;
  for (int i = 0; i < 8; ++i) {
    for (int j = 0; j < 8; ++j) {
      if (w[i][j] == 'M') {
        start = make_pair(i, j);
      }
      if (w[i][j] == 'A') {
        finish = make_pair(i, j);
      }
      if (w[i][j] == 'S') {
        for (int k = i; k < 8; ++k) {
          s.insert(make_pair(make_pair(k, j), k - i));
          s2.insert(make_pair(make_pair(k, j), k - i));
        }
        for (int k = i + 1; k < 8; ++k) {
          s2.insert(make_pair(make_pair(k, j), k - i - 1));
        }
      }
    }
  }
  queue<pair<pair<int, int>, int> > q;
  set<pair<pair<int, int>, int> > was;
  q.push(make_pair(start, 0));
  while (!q.empty()) {
    pair<pair<int, int>, int> pos = q.front();
    q.pop();
    for (int dx = -1; dx < 2; ++dx) {
      for (int dy = -1; dy < 2; ++dy) {
        if (pos.first.first + dx >= 0 && pos.first.first + dx < 8 &&
            pos.first.second + dy >= 0 && pos.first.second + dy < 8 &&
            !s2.count(make_pair(
                make_pair(pos.first.first + dx, pos.first.second + dy),
                pos.second)) &&
            !s.count(make_pair(
                make_pair(pos.first.first + dx, pos.first.second + dy),
                pos.second + 1))) {
          q.push(
              make_pair(make_pair(pos.first.first + dx, pos.first.second + dy),
                        pos.second + 1));
          if (make_pair(pos.first.first + dx, pos.first.second + dy) ==
              finish) {
            cout << "WIN\n";
            return 0;
          }
        }
      }
    }
  }
  cout << "LOSE\n";
  return 0;
}
