int n = 5;
for(int i=0; i<n; i++) {
	if(i<n/2+1) {
		for(int j=0; j<i*2+1; j++) {
			System.out.print("*");
		}
	} else {
		for(int j=(n-i)*2-2; j>=0; j--) {
			System.out.print("*");
		}
	}
	System.out.println();
}

public static void magicSquare(int size) {
        int[][] square = new int[10][10];

        if (size < 1 || size > 10) {
            System.out.println("Error! Size is out of range");
            return;
        }

        if (size % 2 == 0) {
            System.out.println("Error! Size is even");
            return;
        }

        for (int k = 0; k < size; k++)
            for (int l = 0; l < size; l++)
                square[k][l] = 0;

        square[0][(size - 1) / 2] = 1;

        int i, j, row, column;
        i = 0;
        j = (size - 1) / 2;
        for (int c = 2; c <= size * size; c++) {
            row = (i - 1 < 0) ? (size - 1) : (i - 1);
            column = (j - 1 < 0) ? (size - 1) : (j - 1);
            if (square[row][column] > 0)
                i = (++i) % size;
            else {
                i = row;
                j = (j - 1 < 0) ? (size - 1) : --j;
            }
            square[i][j] = c;
        }

        for (int k = 0; k < size; k++) {
            for (int l = 0; l < size; l++) {
                if (square[k][l] < 10)
                    System.out.print("0" + square[k][l] + " | ");
                else
                    System.out.print(square[k][l] + " | ");
            }
            System.out.println("");
        }
    }

public static void toPostfix(String str) {
        String temp = "";
        Stack<Character> stack = new Stack<Character>();
        for (int i = 0; i < str.length(); i++) {
            if ((str.charAt(i) >= 'a' && str.charAt(i) <= 'z') || (str.charAt(i) >= 'A' && str.charAt(i) <= 'Z')) {
                temp += str.charAt(i);
            } else if (str.charAt(i) == '+' || str.charAt(i) == '-') {
                while (stack.size() > 0) {
                    if (stack.peek() != '(')
                        temp += stack.pop();
                    else
                        stack.pop();
                }
                stack.push(str.charAt(i));
            } else if (str.charAt(i) == '*' || str.charAt(i) == '/') {
                try {
                    while (stack.peek() == '*' || stack.peek() == '/') {
                        temp += stack.pop();
                    }
                }
                catch (EmptyStackException e) {}
                stack.push(str.charAt(i));
            } else if (str.charAt(i) == '(') {
                stack.push(str.charAt(i));
            } else if (str.charAt(i) == ')') {
                try {
                    while (stack.peek() != '(') {
                        temp += stack.pop();
                    }
                }
                catch (EmptyStackException e) {}
            }
        }
        while (stack.size() > 0) {
            if (stack.peek() != '(')
                temp += stack.pop();
            else
                stack.pop();
        }

        System.out.println(temp);
    }

class Hello
{

    public static char[] list = { 'a', 'b', 'c' };


    public static void main(String[] args) throws java.lang.Exception
    {
        perm(0, list.length - 1);
    }


    public static void perm(int i, int n) {
        int j, temp;
        if (i == n) {
            for (j = 0; j <= n; j++)
                System.out.print("" + list[j]);
            System.out.println();
        } else {
            for (j = i; j <= n; j++) {
                swap(i, j);
                perm(i + 1, n);
                swap(i, j);
            }
        }
    }


    public static void swap(int i, int j) {
        char temp;
        temp = list[i];
        list[i] = list[j];
        list[j] = temp;
    }
}

public boolean makeBricks(int small, int big, int goal) {
	while(goal>=5 && big>0){
		goal -= 5;
		big--;
	}
	while(goal>=1 && small>0){
		goal -= 1;
		small--;
	}
	if(goal==0)
		return true;
	else
		return false;
}

import java.util.*;
import java.lang.*;
import java.io.*;

class Adicom
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		for (int i=0; i<n; i++) {
		    int len = sc.nextInt();
		    String str = sc.nextLine();
		    str = str.trim();
		    
		    if(len<0) {
		        len = str.length() + len;
		    }
		    String first = str.substring(len);
		    String end = str.substring(0, len);
		    
		    System.out.print(" " + first + end);
		} 
	}
}

public static boolean isPalindrome(String str) {
        System.out.println(str);
        int len = str.length();
        if (len == 1)
            return true;
        if (len == 2)
            return (str.charAt(0) == str.charAt(1));
        if (str.charAt(0) != str.charAt(len - 1)) {
            return false;
        }
        return isPalindrome(str.substring(1, len - 1));
    }

import java.util.*;
import java.lang.*;
import java.io.*;

class Adicom
{
    public static void main (String[] args)
    {
        int num = sc.nextInt();
        String str = Integer.toBinaryString(num);
        int one = 0;
        for (int i = 0; i < str.length(); i++) {
            if (str.charAt(i) == '1') {
                one++;
            }
        }
        System.out.print(" " + one);
    }
}