# Task
 The string is called `prime` if it cannot be constructed by concatenating some (more than one) equal strings together.
 For example, "abac" is prime, but "xyxy" is not("xyxy"="xy"+"xy").
 Given a string determine if it is prime or not.
# Input/Output
 - `[input]` string `s`
  string containing only lowercase English letters
 - `[output]` a boolean value
  `true` if the string is prime, `false` otherwise
def prime_string(s):
    n=len(s)
    return all(s!= s[:i]*(n//i) for i in range(1,n//2 +1))
  
  
  
  

def prime_string(s):
    n=len(s)
    return all(s!= s[:i]*(n//i) for i in range(1,n//2 +1))
  
  
  
  
