Problem: At many competitions that have a word «cup» in its official name the winner is presented with an actual cup. This time the organizers of one unusual programming competition have decided to please the winner even more and to add a nameplate to the cup with the handle of the winner.

The nameplate is to be rectangular and the text on it will be printed as a table of several rows and columns. Having some measurements done, the organizers have found out that the number a of rows cannot be greater than 5 while the number b of columns cannot exceed 20. Every cell of the table will contain either an asterisk («*») or a letter of user's handle.

Furthermore, the organizers want the rows of the table to be uniform, which means that the number of asterisks used in different rows should differ by at most one (i.e. you can't have two asterisks in the first row and none in the second). The main goal, however, is to obtain the winner's handle precisely when reading the table from top to bottom and from left to right in every row (skipping asterisks).

The organizers want for the nameplate to have as few rows as possible and among all valid tables with the minimum number of rows they want to choose the one that has the minimum number of columns.

The winner is not yet determined so your task is to write a program that, given a certain handle, generates the necessary table.

Input

The only line contains one string s (1 ≤ |s| ≤ 100), comprised of uppercase and lowercase Latin letters, — the handle of the winner.

Output

In the first line output the minimum number a of rows in the table and the minimum number b of columns in an optimal table with rows.

The following a lines should contain b characters each — any valid table.

Examples

Input


tourist


Output


1 7
tourist


Input


MyNameIsLifeIAmForeverByYourSideMyNameIsLife


Output


3 15
MyNameIsLifeIAm
ForeverByYourSi
deMyNameIsL*ife

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
std::vector<long long> seive(long long n) {
  std::vector<long long> v(n + 1, 0);
  std::vector<long long> p;
  for (long long i = 2; i * i <= n; i++) {
    if (v[i] == 0) {
      p.push_back(i);
      for (long long j = i; j <= n; j += i) v[i] = 1;
    }
  }
  return p;
}
bool cmp(pair<pair<long long, long long>, long long> a,
         pair<pair<long long, long long>, long long> b) {
  return a.first.first < b.first.first;
}
void solve() {
  string s;
  cin >> s;
  long long n = s.length();
  for (long long r = 1; r <= 5; r++) {
    for (long long c = 1; c <= 20; c++) {
      long long x = r * c;
      if (x < n) continue;
      if (x == n) {
        cout << r << " " << c << "\n";
        long long i = 0;
        for (long long a = 1; a <= r; a++) {
          for (long long b = 1; b <= c; b++) {
            cout << s[i];
            i++;
          }
          cout << "\n";
        }
        return;
      }
      if (x > n) {
        long long d = x - n;
        cout << r << " " << c << "\n";
        long long i = 0;
        for (long long a = 1; a <= r; a++) {
          if (d > 0) {
            cout << "*";
            for (long long b = 2; b <= c; b++) {
              cout << s[i];
              i++;
            }
            d--;
          } else {
            for (long long b = 1; b <= c; b++) {
              cout << s[i];
              i++;
            }
          }
          cout << "\n";
        }
        return;
      }
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
    cout << "\n";
  }
}