#include <cstdio>

#include <cstring>

using namespace std;

char st[100];

int main() {

    scanf("%s", st);

    int n = strlen(st);

    for (int i = 1; i <= n; ++i) {

        if (n % i == 0) {

            char c = st[i - 1];

            if (c >= 'a')

                st[i - 1] = c - 'a' + 'A';

        }

    }

    printf("%s", st);

    return 0;

}

#include <cstdio>

using namespace std;

int n, m;

int a[100], b[100];



int main() {

    scanf("%d%d", &n, &m);

    for (int i = 1; i <= n; ++i)

        a[i] = b[i] = 0;

    for (int i = 1; i <= m; ++i) {

        int x, y;

        scanf("%d%d", &x, &y);

        if (a[x] < y && b[y] < x) {

            if (a[x] > 0)

                b[a[x]] = 0;

            if (b[y] > 0)

                a[b[y]] = 0;

            a[x] = y;

            b[y] = x;

        }

    }

    int ans = 0;

    for (int i = 1; i <= n; ++i) {

        if (a[i] == 0)

            ++ans;

        if (b[i] == 0)

            ++ans;

    }

    printf("%d", ans);

    return 0;

}

#include <iostream>

using namespace std;

const int maxn = 10000;

int n;

int a[maxn];

int b[maxn];

int f(int l, int r, int depth) {

    if (l > r)

        return 0;

    int min = maxn, mink;

    for (int i = l; i <= r; ++i) {

        if (min > a[i]) {

            min = a[i];

            mink = i;

        }

    }

    int lres = f(l, mink - 1, depth + 1);

    int rres = f(mink + 1, r, depth + 1);

    return lres + rres + depth * b[mink];

}

int main() {

    cin >> n;

    for (int i = 0; i < n; ++i)

        cin >> a[i];

    for (int i = 0; i < n; ++i)

        cin >> b[i];

    cout << f(0, n - 1, 1) << endl;

    return 0;

}

#include <cstdio>

using namespace std;

int n;

const int max_size = 1 << 10;



int res[max_size][max_size];



void recursive(int x, int y, int n, int t) {

    if (n == 0) {

        res[x][y] = ①;

        return;

    }

    int step = 1 << (n - 1);

    recursive(②, n - 1, t);

    recursive(x, y + step, n - 1, t);

    recursive(x + step, y, n - 1, t);

    recursive(③, n - 1, !t);

}



int main() {

    scanf("%d", &n);

    recursive(0, 0, ④);

    int size = ⑤;

    for (int i = 0; i < size; i++) {

        for (int j = 0; j < size; j++)

            printf("%d", res[i][j]);

        puts("");

    }

    return 0;

}

#include <cstdio>

#include <cstring>

using namespace std;

const int maxn = 10000000;

const int maxs = 10000;



int n;

unsigned a[maxn], b[maxn],res[maxn], ord[maxn];

unsigned cnt[maxs + 1];

int main() {

    scanf("%d", &n);

    for (int i = 0; i < n; ++i) 

        scanf("%d%d", &a[i], &b[i]);

    memset(cnt, 0, sizeof(cnt));

    for (int i = 0; i < maxs; ++i)

        ①; // 利用 cnt 数组统计数量

    for (int i = 0; i < n; ++i) 

        cnt[i + 1] += cnt[i];

    for (int i = 0; i < n; ++i)

        ②; // 记录初步排序结果

    memset(cnt, 0, sizeof(cnt));

    for (int i = 0; i < n; ++i)

        ③; // 利用 cnt 数组统计数量

    for (int i = 0; i < maxs; ++i)

        cnt[i + 1] += cnt[i];

    for (int i = n - 1; i >= 0; --i)

        ④ // 记录最终排序结果

    for (int i = 0; i < n; i++)

        printf("%d %d", ⑤);



    return 0;

}