Problem: The All-Berland National Olympiad in Informatics has just ended! Now Vladimir wants to upload the contest from the Olympiad as a gym to a popular Codehorses website.

Unfortunately, the archive with Olympiad's data is a mess. For example, the files with tests are named arbitrary without any logic.

Vladimir wants to rename the files with tests so that their names are distinct integers starting from 1 without any gaps, namely, "1", "2", ..., "n', where n is the total number of tests.

Some of the files contain tests from statements (examples), while others contain regular tests. It is possible that there are no examples, and it is possible that all tests are examples. Vladimir wants to rename the files so that the examples are the first several tests, all all the next files contain regular tests only.

The only operation Vladimir can perform is the "move" command. Vladimir wants to write a script file, each of the lines in which is "move file_1 file_2", that means that the file "file_1" is to be renamed to "file_2". If there is a file "file_2" at the moment of this line being run, then this file is to be rewritten. After the line "move file_1 file_2" the file "file_1" doesn't exist, but there is a file "file_2" with content equal to the content of "file_1" before the "move" command.

Help Vladimir to write the script file with the minimum possible number of lines so that after this script is run:

  * all examples are the first several tests having filenames "1", "2", ..., "e", where e is the total number of examples; 
  * all other files contain regular tests with filenames "e + 1", "e + 2", ..., "n", where n is the total number of all tests. 

Input

The first line contains single integer n (1 ≤ n ≤ 105) — the number of files with tests.

n lines follow, each describing a file with test. Each line has a form of "name_i type_i", where "name_i" is the filename, and "type_i" equals "1", if the i-th file contains an example test, and "0" if it contains a regular test. Filenames of each file are strings of digits and small English letters with length from 1 to 6 characters. The filenames are guaranteed to be distinct.

Output

In the first line print the minimum number of lines in Vladimir's script file.

After that print the script file, each line should be "move file_1 file_2", where "file_1" is an existing at the moment of this line being run filename, and "file_2" — is a string of digits and small English letters with length from 1 to 6.

Examples

Input

5
01 0
2 1
2extra 0
3 1
99 0


Output

4
move 3 1
move 01 5
move 2extra 4
move 99 3


Input

2
1 0
2 1


Output

3
move 1 3
move 2 1
move 3 2

Input

5
1 0
11 1
111 0
1111 1
11111 0


Output

5
move 1 5
move 11 1
move 1111 2
move 111 4
move 11111 3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e6 + 88;
const int inf = 1e9 + 88;
const int logn = 22;
const int maxa = 3e6 + 88;
const long long infll = 1e18 + 88;
const char sgl[5] = {'a', 'e', 'i', 'o', 'u'};
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const char sep = 'a' - 1;
const double eps = 1e-9;
int readint() {
  long long cur;
  scanf("%I64d", &cur);
  return cur;
}
vector<string> unused[2];
vector<int> need[2], used[2];
vector<pair<string, string> > ans;
bool is[maxn];
string s;
int stoi_(string s) {
  int res = 0;
  for (int i = 0; i < s.length(); i++) res = res * 10 + s[i] - '0';
  return res;
}
string itos_(int i) {
  string s = "";
  while (i) {
    s += (char)('0' + i % 10);
    i /= 10;
  }
  reverse(s.begin(), s.end());
  return s;
}
void solve() {
  int n, i, j;
  int t, cntunused = 0, cnt = 0;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> s >> t;
    cnt += t;
    bool check = true;
    if (s[0] == '0') check = false;
    for (j = 0; j < s.length(); j++)
      if (s[j] < '0' || s[j] > '9') {
        check = false;
        break;
      }
    int cur = 0;
    if (check) cur = stoi_(s);
    if (cur < 1 || cur > n) {
      cntunused++;
      unused[t].push_back(s);
      continue;
    }
    used[t].push_back(cur);
    is[cur] = true;
  }
  for (i = 0; i < used[0].size(); i++)
    if (used[0][i] <= cnt) need[0].push_back(used[0][i]);
  for (i = 0; i < used[1].size(); i++)
    if (used[1][i] > cnt) need[1].push_back(used[1][i]);
  if (cntunused == 0) {
    if (need[0].size() == 0) {
      cout << 0;
      return;
    }
    ans.push_back({itos_(need[0].back()), itos_(n + 1)});
    unused[0].push_back(itos_(n + 1));
    is[need[0].back()] = false;
    need[0].pop_back();
  }
  int cur;
  for (i = 1; i <= n; i++)
    if (is[i] == false) {
      cur = i;
      break;
    }
  while (!is[cur])
    if (cur > cnt) {
      if (need[0].empty()) break;
      is[cur] = true;
      ans.push_back({itos_(need[0].back()), itos_(cur)});
      cur = need[0].back();
      need[0].pop_back();
      is[cur] = false;
    } else {
      if (need[1].empty()) break;
      is[cur] = true;
      ans.push_back({itos_(need[1].back()), itos_(cur)});
      cur = need[1].back();
      need[1].pop_back();
      is[cur] = false;
    }
  for (i = 1; i <= n; i++)
    if (!is[i]) {
      if (i > cnt && !need[0].empty()) {
        is[i] = true;
        is[need[0].back()] = false;
        ans.push_back({itos_(need[0].back()), itos_(i)});
        need[0].pop_back();
      }
      if (i <= cnt && !need[1].empty()) {
        is[i] = true;
        is[need[1].back()] = false;
        ans.push_back({itos_(need[1].back()), itos_(i)});
        need[1].pop_back();
      }
    }
  for (i = 1; i <= n; i++)
    if (!is[i]) {
      if (i > cnt) {
        is[i] = true;
        ans.push_back({unused[0].back(), itos_(i)});
        unused[0].pop_back();
      }
      if (i <= cnt) {
        is[i] = true;
        ans.push_back({unused[1].back(), itos_(i)});
        unused[1].pop_back();
      }
    }
  cout << ans.size() << "\n";
  for (i = 0; i < ans.size(); i++)
    cout << "move " << ans[i].first << " " << ans[i].second << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  solve();
  return 0;
}