def isPrime(n):

    if (n < 2):
        return False
    for i in range(2, n + 1):
        if (i * i <= n and n% i == 0):
            return False
    return True

def mobius(N):

    
    if (N == 1):
        return 1

    
    
    
    p = 0
    for i in range(1, N + 1):
        if (N% i == 0 and
                isPrime(i)):

            
            
            if (N% (i * i) == 0):
                return 0
            else:

                
                
                p = p + 1

    
    
    
    
    if(p% 2 != 0):
        return -1
    else:
        return 1


print()

for i in range(1, 100):
  print(f, end = '')

  if i% 20 == 0: print()