MathDB

Given an integer

n

,For a sequence of

X

with the number of

n

and

Y

with the number of

100n

, we call it a spring . We have two following rules

\blacksquare

Choose four adjacent character , if it is

YXXY

, than it can be changed into

XYYX

\blacksquare

Choose. four adjacent character , if it is

XYYX

, than it can be changed into

YXXY

If spring

A

can become

B

using the rules , than we call they are [color=#3D85C6]similar Thy to find the maximum of

C

such that there exists

C

distinct springs and they are [color=#3D85C6]similar

Problem Statement