#include <bits/stdc++.h>
using namespace std;
void _dbg(string) { cout << endl; }
template <class H, class... T>
void _dbg(string s, H h, T... t) {
  int l = s.find(',');
  cout << s.substr(0, l) << " = " << h << ", ";
  _dbg(s.substr(l + 1), t...);
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &p) {
  o << "(" << p.first << "," << p.second << ")";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const vector<T> &v) {
  o << "[";
  for (T t : v) {
    o << t << ",";
  }
  o << "]";
  return o;
}
pair<string, int> vec[100005];
int isnumber(const string &s) {
  int ret = 0;
  int i = 0;
  if (s[0] == '0') return -1;
  while (i < s.size() && isdigit(s[i])) ret = ret * 10 + s[i++] - '0';
  if (i < s.size()) return -1;
  return ret;
}
unordered_set<string> names;
string rand_name() {
  string ret;
  for (int i = (int)(0); i < (int)(6); i++) ret.push_back((rand() % 26 + 'a'));
  if (names.count(ret) == 1) return rand_name();
  names.insert(ret);
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = (int)(0); i < (int)(n); i++) {
    cin >> vec[i].first >> vec[i].second;
  }
  for (int i = (int)(0); i < (int)(n); i++) names.insert(vec[i].first);
  int e = 0;
  for (int i = (int)(0); i < (int)(n); i++) e += vec[i].second;
  vector<bool> used(n + 1, false);
  vector<int> q[2][2];
  for (int i = (int)(0); i < (int)(n); i++) {
    int r = isnumber(vec[i].first);
    if (r > 0 && r <= n) {
      used[r] = true;
      if (r <= e && vec[i].second == 1) continue;
      if (r > e && vec[i].second == 0) continue;
      q[0][vec[i].second].push_back((i));
    } else {
      q[1][vec[i].second].push_back((i));
    }
  }
  vector<int> empe, empn;
  for (int i = (int)(1); i < (int)(n + 1); i++)
    if (!used[i]) {
      if (i <= e)
        empe.push_back((i));
      else
        empn.push_back((i));
    }
  stringstream ans;
  int cnt = 0;
  while (q[0][1].size() || q[0][0].size()) {
    if (empe.size() == 0 && empn.size() == 0) {
      for (int i = (int)(0); i < (int)(2); i++) {
        if (q[0][i].size()) {
          int v = q[0][i].back();
          q[0][i].pop_back();
          string nn = rand_name();
          ans << "move " << vec[v].first << " " << nn << "\n";
          cnt++;
          int u = isnumber(vec[v].first);
          used[u] = false;
          if (i == 0)
            empe.push_back((u));
          else
            empn.push_back((u));
          vec[v].first = nn;
          q[1][i].push_back((v));
          break;
        }
      }
    }
    if (empe.size() && q[0][1].size()) {
      int v = q[0][1].back();
      q[0][1].pop_back();
      int u = empe.back();
      empe.pop_back();
      ans << "move " << vec[v].first << " " << u << " \n";
      cnt++;
      v = isnumber(vec[v].first);
      used[u] = true;
      used[v] = false;
      empn.push_back((v));
    }
    if (empn.size() && q[0][0].size()) {
      int v = q[0][0].back();
      q[0][0].pop_back();
      int u = empn.back();
      empn.pop_back();
      ans << "move " << vec[v].first << " " << u << " \n";
      cnt++;
      v = isnumber(vec[v].first);
      used[u] = true;
      used[v] = false;
      empe.push_back((v));
    }
  }
  for (int i = (int)(0); i < (int)(2); i++) {
    while (q[1][i].size()) {
      int to;
      if (i == 1) {
        to = empe.back();
        empe.pop_back();
      } else {
        to = empn.back();
        empn.pop_back();
      }
      int v = q[1][i].back();
      q[1][i].pop_back();
      ans << "move " << vec[v].first << " " << to << "\n";
      cnt++;
    }
  }
  cout << cnt << '\n';
  cout << ans.str();
  return 0;
}
