#include <bits/stdc++.h>
using namespace std;
const long long N = 50005;
const long long mod = (1e9) + 7;
long long gcd(long long a, long long b) {
  return ((b == 0) ? a : gcd(b, a % b));
}
void solve() {
  int n, i, a, b;
  string s;
  cin >> s;
  n = s.length();
  vector<pair<int, int> > v(101, {0, 0});
  for (i = 1; i <= 100; i++) {
    for (int j = 1; j <= i; j++) {
      if (i % j == 0) {
        a = j;
        b = i / j;
        if (a <= 5 && b <= 20) {
          v[i].first = a;
          v[i].second = b;
          break;
        }
      }
    }
  }
  int row = 101, col = 101;
  for (i = n; i <= 100; i++) {
    if (v[i].first > 0) row = min(row, v[i].first);
  }
  for (i = n; i <= 100; i++) {
    if (v[i].first == row) col = min(col, v[i].second);
  }
  cout << row << " " << col << "\n";
  a = 1;
  b = row * col;
  n = b - n;
  for (auto x : s) {
    cout << x;
    a++;
    if (a == col && n > 0) {
      cout << "*"
           << "\n";
      n--;
      a = 1;
    } else if (a > col) {
      cout << "\n";
      a = 1;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
