#include <string>
#include <vector>
#include <deque>
#include <list>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
using namespace std;

class Cell {
  public:
    vector <Cell *> adj;
    class Component *comp;
    int row;
    int col;
    int state;                // '.', 'o'
    int number;
};

class Component {
  public:
    int type;        /* '.' or 'o' */
    int number;
    vector <Cell *> cells;
    map <int, Component *> adj;
    map <int, int> adjcount;
    set <int> unsafe_neighbors;
    bool done;
};

class FoxAndGo2 {
  public:
    int maxKill(vector <string> board);
    void DFS(Cell *c, Cell *start);
    vector <string> Board;
    vector < vector <Cell *> > Cells;
    vector <Cell *> All;
    vector < Component * > White_Components;
    vector < Component * > Empty_Components;
    vector < Component * > Components;
    deque < Component * > Killable;
    int Rows;
    int Cols;
};

int FoxAndGo2::maxKill(vector <string> board)
{
  return 0;
}