String Rotation Verification

Given two strings s₁ and s₂, determine whether s₂ is a rotation of s₁. A string s₂ is considered a rotation of s₁ if it can be obtained by moving a prefix of s₁ to its end.

Formally, if the length of s₁ is \(n\), then s₂ is a rotation of s₁ if there exists an integer \(k\) with \(0 \le k < n\) such that:

\( s_2 = s_1[k:] + s_1[:k] \)

You are required to read the input from stdin and output the result to stdout as described below.

inputFormat

The input consists of two lines:

The first line contains the string s1. The second line contains the string s2.

outputFormat

Output a single line with either "True" if s2 is a rotation of s1, or "False" otherwise.## sample

abc
bca

True