






"""simple docstring"""







def       _lowerCAmelCase       (      lowerCAmelCase	,      lowerCAmelCase		):







       '''simple docstring'''
       UpperCAmelCase	    =			len(lowerCAmelCase		)
       UpperCAmelCase	    =			[]
       for i in range(len(lowerCAmelCase		) - pat_len + 1		):
              UpperCAmelCase	    =			True
              for j in range(lowerCAmelCase		):
                     if s[i + j] != pattern[j]:
                            UpperCAmelCase	    =			False
                            break
              if match_found:
                     position.append(lowerCAmelCase		)
       return position


if __name__ == "__main__":
 assert naive_pattern_search('''ABCDEFG''', '''DE''') == [3]
 print(naive_pattern_search('''ABAAABCDBBABCDDEBCABC''', '''ABC'''))








"""simple docstring"""







def       _lowerCAmelCase       (      lowerCAmelCase		):







       '''simple docstring'''
       if not isinstance(lowerCAmelCase	,      lowerCAmelCase		):
              UpperCAmelCase	    =			F'''Input value of [number={number}] must be an integer'''
              raise TypeError(lowerCAmelCase		)
       if number < 0:
              return False
       UpperCAmelCase	    =			number * number
       while number > 0:
              if number % 10 != number_square % 10:
                     return False
              number //= 10
              number_square //= 10
       return True


if __name__ == "__main__":
 import doctest

 doctest.testmod()
