The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Codeforces Round 117 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

brute force

hashing

implementation

math

strings

*1400

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Common Divisors

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVasya has recently learned at school what a number's divisor is and decided to determine a string's divisor. Here is what he came up with.

String *a* is the divisor of string *b* if and only if there exists a positive integer *x* such that if we write out string *a* consecutively *x* times, we get string *b*. For example, string "abab" has two divisors — "ab" and "abab".

Now Vasya wants to write a program that calculates the number of common divisors of two strings. Please help him.

Input

The first input line contains a non-empty string *s*_{1}.

The second input line contains a non-empty string *s*_{2}.

Lengths of strings *s*_{1} and *s*_{2} are positive and do not exceed 10^{5}. The strings only consist of lowercase Latin letters.

Output

Print the number of common divisors of strings *s*_{1} and *s*_{2}.

Examples

Input

abcdabcd

abcdabcdabcdabcd

Output

2

Input

aaa

aa

Output

1

Note

In first sample the common divisors are strings "abcd" and "abcdabcd".

In the second sample the common divisor is a single string "a". String "aa" isn't included in the answer as it isn't a divisor of string "aaa".

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/30/2023 11:54:17 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|