Problem title
Difficulty
Avg time to solve

Moderate
35 mins
Mike and Mobile
Moderate
35 mins
Find Kth row of Pascal's Triangle
Easy
15 mins
Kruskal’s Minimum Spanning Tree Algorithm
Moderate
--
Longest Valid Parentheses
Moderate
10 mins
Decode Ways
Moderate
15 mins
Capture region
Moderate
10 mins
Largest Distance Between Two Nodes In A Tree
Moderate
15 mins
Maximum Number
Easy
15 mins
Shortest Alternating Path
Moderate
10 mins
5

# Print Name

Difficulty: EASY
Contributed By
Avg. time to solve
5 min
Success Rate
100%

Problem Statement

#### You are given a string ‘S’ of lowercase English alphabets, you are required to print ‘S’ 5 times, each on a new line using a while loop.

##### EXAMPLE:
``````Input: 'S' = ‘alicia’

Output: alicia
alicia
alicia
alicia
alicia
``````
##### Input Format :
``````The first line will contain the integer 'T', the number of test cases.

For each test case, there will be only one line containing a string ‘S’.
``````
##### Output format :
``````For each test case, print the ‘name’ five times, each on a new line.
``````
##### Note :
``````You don't need to print anything. It has already been taken care of. Just implement the given function.
``````
##### Constraints :
``````1 <= 'T' <= 10
1 <= 'S.Length' <= 10^4

Time Limit: 1 sec
``````
##### Sample Input 1 :
``````2
ramu
shamu
``````
##### Sample Output 1 :
``````ramu
ramu
ramu
ramu
ramu
shamu
shamu
shamu
shamu
shamu
``````
##### Sample Input 2 :
``````2
ankush
kannu
``````
##### Sample Output 2 :
``````ankush
ankush
ankush
ankush
ankush
kannu
kannu
kannu
kannu
kannu
``````
Console