diff --git a/Level1/Lessons12901/hakamma.py b/Level1/Lessons12901/hakamma.py
new file mode 100644
index 0000000..cc59ff7
--- /dev/null
+++ b/Level1/Lessons12901/hakamma.py
@@ -0,0 +1,12 @@
+2016년 연습문제 (날짜)
+
+def solution(a, b):
+    answer = ''
+    month = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
+    day = ["FRI", "SAT", "SUN", "MON", "TUE", "WED", "THU"]
+    x = 0
+    for i in range(0, a-1):
+        x = x+month[i]
+    
+    answer = day[(x+b-1)%7]
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12903/hakamma.py b/Level1/Lessons12903/hakamma.py
new file mode 100644
index 0000000..136398c
--- /dev/null
+++ b/Level1/Lessons12903/hakamma.py
@@ -0,0 +1,9 @@
+가운데 글자 찾기
+
+def solution(s):
+    answer = ''
+    if len(s) % 2 == 0:
+        return s[(len(s)//2)-1:(len(s)//2)+1] // index로 접근
+    else:
+        return s[len(s)//2]
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12906/hakamma.py b/Level1/Lessons12906/hakamma.py
new file mode 100644
index 0000000..01a88d0
--- /dev/null
+++ b/Level1/Lessons12906/hakamma.py
@@ -0,0 +1,13 @@
+#12906 ���� ���ڴ� �Ⱦ� 
+
+def solution(arr):
+    answer = []
+    for i in range(0,len(arr)):
+        if i == 0:
+            answer.append(arr[i])
+        else:
+            if arr[i] == arr[i-1]:
+                continue
+            else:
+                answer.append(arr[i])
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12910/hakamma.py b/Level1/Lessons12910/hakamma.py
new file mode 100644
index 0000000..f94b2bf
--- /dev/null
+++ b/Level1/Lessons12910/hakamma.py
@@ -0,0 +1,13 @@
+#12910 ������ �������� ���� �迭
+
+def solution(arr, divisor):
+    answer = []
+    for i in range(0,len(arr)):
+        if arr[i] % divisor == 0:
+            answer.append(arr[i])
+        
+    answer.sort()
+    if len(answer) == 0:
+        answer.append(-1)
+    
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12912/hakamma.py b/Level1/Lessons12912/hakamma.py
new file mode 100644
index 0000000..5e4aa65
--- /dev/null
+++ b/Level1/Lessons12912/hakamma.py
@@ -0,0 +1,12 @@
+#12912 �� ���� ������ ��
+
+def solution(a, b):
+    answer = 0
+    if a<=b:
+        for i in range(a,b+1):
+            answer += i
+    else:
+        for i in range(b,a+1):
+            answer += i
+        
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12915/hakamma.py b/Level1/Lessons12915/hakamma.py
new file mode 100644
index 0000000..6b27f56
--- /dev/null
+++ b/Level1/Lessons12915/hakamma.py
@@ -0,0 +1,16 @@
+#12915 문자열 내 마음대로 정렬하기
+
+def solution(strings, n):
+    answer = []
+    a = []
+    strings.sort()
+    for i in strings:
+        a.append(i[n])
+    a.sort()
+    
+    for j in a:
+        for k in range(len(a)):
+            if j == strings[k][n]:
+                answer.append(strings[k])
+                strings[k] = '0'*100 # 중복방지를 위해 요소의 값 변경
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12916/hakamma.py b/Level1/Lessons12916/hakamma.py
new file mode 100644
index 0000000..164e593
--- /dev/null
+++ b/Level1/Lessons12916/hakamma.py
@@ -0,0 +1,17 @@
+#12916 ���ڿ� �� p�� y�� ����
+
+def solution(s):
+    answer = True
+    s1 = s.lower()
+    pcount = 0
+    ycount = 0
+    for i in range(len(s1)):
+        if s1[i] == 'p':
+            pcount += 1
+        elif s1[i] == 'y':
+            ycount += 1
+    if pcount == ycount:
+        answer = True
+    elif pcount != ycount:
+        answer = False
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12917/hakamma.py b/Level1/Lessons12917/hakamma.py
new file mode 100644
index 0000000..c958485
--- /dev/null
+++ b/Level1/Lessons12917/hakamma.py
@@ -0,0 +1,16 @@
+#12917 ���ڿ� ������������ ��ġ�ϱ�
+
+def solution(s):
+    answer = ''
+    s1 = s.lower()
+    upper_char = []
+    lower_char = []
+    for i in range(len(s)):
+        if s[i] == s1[i]:
+            lower_char.append(s[i])
+        else:
+            upper_char.append(s[i])
+    upper_char.sort(reverse=True)
+    lower_char.sort(reverse=True)
+    answer = "".join(lower_char) + "".join(upper_char)
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12918/hakamma.py b/Level1/Lessons12918/hakamma.py
new file mode 100644
index 0000000..bdeb5c4
--- /dev/null
+++ b/Level1/Lessons12918/hakamma.py
@@ -0,0 +1,8 @@
+#12918 ���ڿ� �ٷ�� �⺻
+
+def solution(s):
+    answer = False
+    if len(s) == 4 or len(s) == 6:
+        if s.isdigit() == True:
+            answer = True
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12919/hakamma.py b/Level1/Lessons12919/hakamma.py
new file mode 100644
index 0000000..ef13128
--- /dev/null
+++ b/Level1/Lessons12919/hakamma.py
@@ -0,0 +1,7 @@
+#12919 ���￡�� �輭�� ã��
+
+def solution(seoul):
+    answer = ''
+    a = seoul.index("Kim")
+    answer = '�輭���� '+ str(a) +'�� �ִ�'
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12921/hakamma.py b/Level1/Lessons12921/hakamma.py
new file mode 100644
index 0000000..896a6ea
--- /dev/null
+++ b/Level1/Lessons12921/hakamma.py
@@ -0,0 +1,9 @@
+#12921 �Ҽ� ã��
+
+def solution(n):
+    num=set(range(2,n+1)) # 2���� n+1������ ����
+
+    for i in range(2,n+1): # 2���� n���� �ݺ���
+        if i in num: # ���� i�� num ���տ� �ִٸ�
+            num-=set(range(2*i,n+1,i)) # i�� ����� num ���տ��� ����
+    return len(num) # num�� �����ִ� ������ ������ �Ҽ��� ����
\ No newline at end of file
diff --git a/Level1/Lessons12922/hakamma.py b/Level1/Lessons12922/hakamma.py
new file mode 100644
index 0000000..2cf6a3c
--- /dev/null
+++ b/Level1/Lessons12922/hakamma.py
@@ -0,0 +1,10 @@
+#12922 ���ڼ��ڼ��ڼ�?
+
+def solution(n):
+    answer = ''
+    for i in range(n):
+        if i%2 == 0:
+            answer += "��"
+        elif i%2 == 1:
+            answer += "��"
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12925/hakamma.py b/Level1/Lessons12925/hakamma.py
new file mode 100644
index 0000000..fbb4fc2
--- /dev/null
+++ b/Level1/Lessons12925/hakamma.py
@@ -0,0 +1,9 @@
+#12925 ���ڿ��� ������ �ٲٱ�
+
+def solution(s):
+    answer = 0
+    if s[0] == '-':
+        answer = -int(s[1:])
+    else:
+        answer = int(s[:])
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12926/hakamma.py b/Level1/Lessons12926/hakamma.py
new file mode 100644
index 0000000..5828afa
--- /dev/null
+++ b/Level1/Lessons12926/hakamma.py
@@ -0,0 +1,16 @@
+#12926 ���� ��ȣ
+
+def solution(s, n):
+    low_char = "abcdefghijklmnopqrstuvwxyz"
+    up_char = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
+    answer = ''
+    for char in s:
+        if char in low_char:
+            ind = low_char.find(char)+n # low ���ڿ����� ã�� �ش� ���ĺ� �ε��� + n
+            answer += low_char[ind%26] # 26���� ���� �������� ����� ��� 25�� �ʰ��ϴ� ��쵵 Ȱ�� ����
+        elif char in up_char:
+            ind = up_char.find(char)+n
+            answer += up_char[ind%26]
+        else:
+            answer += " "
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12928/hakamma.py b/Level1/Lessons12928/hakamma.py
new file mode 100644
index 0000000..aa6bab5
--- /dev/null
+++ b/Level1/Lessons12928/hakamma.py
@@ -0,0 +1,12 @@
+#12928 ����� ��
+
+def solution(n):
+    answer = 0
+    for i in range(1,n+1):
+        if n%i == 0:
+            answer += i
+    if n == 0:
+        answer = 0
+    elif n == 1:
+        answer = 1
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12930/hakamma.py b/Level1/Lessons12930/hakamma.py
new file mode 100644
index 0000000..93a1c3a
--- /dev/null
+++ b/Level1/Lessons12930/hakamma.py
@@ -0,0 +1,14 @@
+#12930 �̻��� ���� �����
+
+def solution(s):
+    answer = ''
+    new_s = s.split(' ')
+    
+    for char in new_s:
+        for i in range(len(char)):
+            if i%2 == 0:
+                answer += char[i].upper()
+            elif i%2 == 1:
+                answer += char[i].lower()
+        answer += ' '
+    return answer[:-1]
\ No newline at end of file
diff --git a/Level1/Lessons12931/hakamma.py b/Level1/Lessons12931/hakamma.py
new file mode 100644
index 0000000..46d4c70
--- /dev/null
+++ b/Level1/Lessons12931/hakamma.py
@@ -0,0 +1,8 @@
+#12931 자릿수 더하기
+
+def solution(n):
+    answer = 0
+    n_number = str(n)
+    for i in range(len(n_number)):
+        answer += int(n_number[i])
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12932/hakamma.py b/Level1/Lessons12932/hakamma.py
new file mode 100644
index 0000000..adbb620
--- /dev/null
+++ b/Level1/Lessons12932/hakamma.py
@@ -0,0 +1,8 @@
+#12932 자연수 뒤집어 배열로 만들기
+
+def solution(n):
+    answer = []
+    n_number = str(n)
+    for i in range(len(n_number)):
+        answer.append(int(n_number[len(n_number)-i-1]))
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12933/hakamma.py b/Level1/Lessons12933/hakamma.py
new file mode 100644
index 0000000..fe04ef5
--- /dev/null
+++ b/Level1/Lessons12933/hakamma.py
@@ -0,0 +1,13 @@
+#12933 정수 내림차순으로 배치하기
+
+def solution(n):
+    answer = 0
+    n_number = str(n)
+    t = []
+    for i in range(len(n_number)):
+        t.append(int(n_number[len(n_number)-i-1]))
+    
+    t.sort(reverse=True)
+    s=''.join(map(str,t)) # 리스트를 특정 구분자를 포함해 문자열로 변환
+    answer = int(s)
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12934/hakamma.py b/Level1/Lessons12934/hakamma.py
new file mode 100644
index 0000000..e61c2fa
--- /dev/null
+++ b/Level1/Lessons12934/hakamma.py
@@ -0,0 +1,10 @@
+#12934 정수 제곱근 판별
+
+def solution(n):
+    answer = 0
+    a = n**(1/2)
+    if int(a) == a:
+        answer = (a+1)**2
+    else:
+        answer = -1
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12935/hakamma.py b/Level1/Lessons12935/hakamma.py
new file mode 100644
index 0000000..5eb11a5
--- /dev/null
+++ b/Level1/Lessons12935/hakamma.py
@@ -0,0 +1,11 @@
+#12935 ���� ���� �� �����ϱ�
+
+def solution(arr):
+    answer = []
+    if len(arr) > 1:
+        arr.remove(min(arr))
+        answer = arr
+    else:
+        answer = [-1]
+    
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12937/hakamma.py b/Level1/Lessons12937/hakamma.py
new file mode 100644
index 0000000..10978a2
--- /dev/null
+++ b/Level1/Lessons12937/hakamma.py
@@ -0,0 +1,9 @@
+#12937 ¦���� Ȧ��
+
+def solution(num):
+    answer = ''
+    if num % 2 == 0:
+        answer = 'Even'
+    else:
+        answer = 'Odd'
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12940/hakamma.py b/Level1/Lessons12940/hakamma.py
new file mode 100644
index 0000000..08cebe1
--- /dev/null
+++ b/Level1/Lessons12940/hakamma.py
@@ -0,0 +1,19 @@
+#12940 �ִ������� �ּҰ����
+
+def solution(n, m):
+    answer = []
+    max_answer = 0
+    min_answer = 0
+    if n >= m:
+        for i in range(1,n+1):
+            if n % i == 0 and m % i == 0:
+                max_answer = i
+        answer.append(max_answer)
+    elif n < m:
+        for j in range(1,m+1):
+            if n % j == 0 and m % j == 0:
+                max_answer = j
+        answer.append(max_answer)
+    min_answer = n * m / max_answer
+    answer.append(min_answer)
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12943/hakamma.py b/Level1/Lessons12943/hakamma.py
new file mode 100644
index 0000000..62cd911
--- /dev/null
+++ b/Level1/Lessons12943/hakamma.py
@@ -0,0 +1,15 @@
+#12943 �ݶ��� ����
+
+def solution(num):
+    answer = 0
+    while True:
+        if num == 1:
+            return answer
+        if num % 2 == 0:
+            num = num/2
+        elif num % 2 == 1:
+            num = num * 3 + 1
+        if answer == 500:
+            return -1
+        answer += 1
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12944/hakamma.py b/Level1/Lessons12944/hakamma.py
new file mode 100644
index 0000000..9bd5e0e
--- /dev/null
+++ b/Level1/Lessons12944/hakamma.py
@@ -0,0 +1,9 @@
+#12944 ��� ���ϱ�
+
+def solution(arr):
+    answer = 0
+    sum_arr = 0
+    for i in range(len(arr)):
+        sum_arr += (arr[i])
+    answer = float(sum_arr) / float(len(arr))
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12947/hakamma.py b/Level1/Lessons12947/hakamma.py
new file mode 100644
index 0000000..ac21ea3
--- /dev/null
+++ b/Level1/Lessons12947/hakamma.py
@@ -0,0 +1,13 @@
+#12947 �ϻ��� ��
+
+def solution(x):
+    answer = True
+    arr = list(str(x))
+    sum_arr = 0
+    for i in range(len(arr)):
+        sum_arr += int(arr[i])
+    if x%sum_arr == 0:
+        answer = True
+    elif x%sum_arr != 0:
+        answer = False
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12948/hakamma.py b/Level1/Lessons12948/hakamma.py
new file mode 100644
index 0000000..a7e1f7c
--- /dev/null
+++ b/Level1/Lessons12948/hakamma.py
@@ -0,0 +1,10 @@
+#12948 �ڵ��� ��ȣ ������
+
+def solution(phone_number):
+    answer = ''
+    for i in range(len(phone_number)):
+        if len(phone_number) - i <=4:
+            answer += phone_number[i]
+        else:
+            answer += '*'
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12950/hakamma.py b/Level1/Lessons12950/hakamma.py
new file mode 100644
index 0000000..9e31de8
--- /dev/null
+++ b/Level1/Lessons12950/hakamma.py
@@ -0,0 +1,8 @@
+#12950 ����� ����
+
+def solution(arr1, arr2):
+    answer = arr1
+    for i in range(len(arr1)):
+        for j in range(len(arr1[i])):
+            answer[i][j] = arr1[i][j] + arr2[i][j]
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12954/hakamma.py b/Level1/Lessons12954/hakamma.py
new file mode 100644
index 0000000..a817a57
--- /dev/null
+++ b/Level1/Lessons12954/hakamma.py
@@ -0,0 +1,7 @@
+#12954 x��ŭ ������ �ִ� n���� ����
+
+def solution(x, n):
+    answer = []
+    for i in range(0,n):
+        answer.append(x*(i+1))
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons12969/hakamma.py b/Level1/Lessons12969/hakamma.py
new file mode 100644
index 0000000..770db80
--- /dev/null
+++ b/Level1/Lessons12969/hakamma.py
@@ -0,0 +1,5 @@
+#12969 ���簢�� �� ���
+
+a, b = map(int, input().strip().split(' '))
+for i in range(0,b):
+    print("*"*a)
\ No newline at end of file
diff --git a/Level1/Lessons17682/hakamma.py b/Level1/Lessons17682/hakamma.py
new file mode 100644
index 0000000..86b00e6
--- /dev/null
+++ b/Level1/Lessons17682/hakamma.py
@@ -0,0 +1,41 @@
+#17682 ��Ʈ ����
+
+def solution(dartResult):
+    dart = list(dartResult)
+    answer = 0
+    score = []
+    t = 0
+    for i in range(0,len(dart)):
+        if dart[i].isdigit():
+            if dart[i+1].isdigit():
+                score.append(10)
+            elif dart[i-1].isdigit():
+                continue
+            else:
+                score.append(int(dart[i]))
+        else:
+            if dart[i] == 'D':
+                score[t]**=2
+                t+=1
+            elif dart[i] == 'T':
+                score[t]**=3
+                t+=1
+            elif dart[i] == 'S':
+                score[t]**=1
+                t+=1
+                
+            elif dart[i] == '#':
+                score[t-1]*=(-1)
+                
+            elif dart[i] == '*':
+                if len(score) == 1:
+                    score[t-1]*=2
+                    
+                else:
+                    score[t-1]*=2
+                    score[t-2]*=2
+                
+    
+    answer = sum(score)
+            
+    return answer
\ No newline at end of file
diff --git "a/Level1/Lessons42576/\354\231\204\354\243\274\355\225\230\354\247\200 \353\252\273\355\225\234 \354\204\240\354\210\230.py" "b/Level1/Lessons42576/\354\231\204\354\243\274\355\225\230\354\247\200 \353\252\273\355\225\234 \354\204\240\354\210\230.py"
new file mode 100644
index 0000000..76dd332
--- /dev/null
+++ "b/Level1/Lessons42576/\354\231\204\354\243\274\355\225\230\354\247\200 \353\252\273\355\225\234 \354\204\240\354\210\230.py"	
@@ -0,0 +1,12 @@
+완주하지 못한 선수
+
+def solution(participant, completion):
+    answer = ''
+    participant.sort()
+    completion.sort()
+    for c in range(len(completion)):
+        for p in range(len(participant)):
+            if participant[p] == completion[c]:
+                participant.remove(participant[p])
+                break
+    return (participant[len(participant)-1])
\ No newline at end of file
diff --git a/Level1/Lessons42748/hakamma.py b/Level1/Lessons42748/hakamma.py
new file mode 100644
index 0000000..c9a8fa1
--- /dev/null
+++ b/Level1/Lessons42748/hakamma.py
@@ -0,0 +1,12 @@
+k번째 수
+def solution(array, commands):
+    answer = []
+    
+    for x in commands:
+        i = x[0]
+        j = x[1]
+        k = x[2]
+        A = array[i-1:j] // i번째에서 k번째까지 자르는 순서
+        A.sort() // 
+        answer.append(A[k-1]) // index의 첫번째는 0이므로 -1을 진행
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons42840/hakamma.py b/Level1/Lessons42840/hakamma.py
new file mode 100644
index 0000000..116ac96
--- /dev/null
+++ b/Level1/Lessons42840/hakamma.py
@@ -0,0 +1,24 @@
+def solution(answers):
+    answer = []
+    a = [1,2,3,4,5]
+    b = [2,1,2,3,2,4,2,5]
+    c = [3,3,1,1,2,2,4,4,5,5]
+    scores = [0,0,0]
+
+    for i in range(len(answers)):
+        if answers[i] == a[i%len(a)]:
+            scores[0] += 1
+        
+        if answers[i] == b[i%len(b)]:
+            scores[1] += 1
+        
+        if answers[i] == c[i%len(c)]:
+            scores[2] += 1
+            
+    result = max(scores)
+    
+    for k in range(len(scores)):
+        if scores[k] == result:
+            answer.append(k+1)
+
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons42862/hakamma.py b/Level1/Lessons42862/hakamma.py
new file mode 100644
index 0000000..5e9efe9
--- /dev/null
+++ b/Level1/Lessons42862/hakamma.py
@@ -0,0 +1,24 @@
+체육복
+
+def solution(n, lost, reserve):
+    answer = 0
+    
+    for i in range(1, n+1):
+        if i not in lost:
+            answer += 1
+        else:
+            if i in reserve:
+                answer += 1
+                reserve.remove(i)
+                lost.remove(i)
+    
+    for i in lost:
+        if i-1 in reserve:
+            answer += 1
+            reserve.remove(i-1)
+        
+        elif i+1 in reserve:
+            answer += 1
+            reserve.remove(1+i)
+    
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons64061/hakamma.py b/Level1/Lessons64061/hakamma.py
new file mode 100644
index 0000000..bbcabc0
--- /dev/null
+++ b/Level1/Lessons64061/hakamma.py
@@ -0,0 +1,16 @@
+크레인 인형뽑기
+
+def solution(board, moves):
+    answer = 0
+    moved = []
+    for x in moves:
+        x -= 1
+        for i in range(len(board)):
+            if board[i][x] != 0:
+                moved.append(board[i][x])
+                board[i][x] = 0
+                if moved[-1] == moved[-2]:
+                    moved.pop(-1)
+                    moved.pop(-1)
+                    answer += 2
+    return answer
\ No newline at end of file
diff --git "a/Level1/Lessons68644/\353\221\220 \352\260\234 \353\275\221\354\225\204\354\204\234 \353\215\224\355\225\230\352\270\260.py" "b/Level1/Lessons68644/\353\221\220 \352\260\234 \353\275\221\354\225\204\354\204\234 \353\215\224\355\225\230\352\270\260.py"
new file mode 100644
index 0000000..2902976
--- /dev/null
+++ "b/Level1/Lessons68644/\353\221\220 \352\260\234 \353\275\221\354\225\204\354\204\234 \353\215\224\355\225\230\352\270\260.py"	
@@ -0,0 +1,11 @@
+두 개 뽑아서 더하기
+
+def solution(numbers):
+    answer = []
+    for i in range(len(numbers)):
+        for j in range(len(numbers)):
+            if i!=j:
+                if numbers[i] + numbers[j] not in answer:
+                    answer.append(numbers[i]+numbers[j])
+    answer.sort()
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons68935/hakamma.py b/Level1/Lessons68935/hakamma.py
new file mode 100644
index 0000000..2d52edd
--- /dev/null
+++ b/Level1/Lessons68935/hakamma.py
@@ -0,0 +1,16 @@
+3진법 뒤집기
+
+def solution(n):
+    result = 0
+    answer = ''
+    while n>=1:
+        remain = n%3
+        dev = n//3
+        n = dev
+        answer = answer + str(remain)
+
+    for i in range(len(answer)-1,-1,-1):
+        result += int(answer[i]) * (3**(len(answer)-i-1))
+        
+
+    return result
\ No newline at end of file
diff --git a/Level1/Lessons72410/hakamma.py b/Level1/Lessons72410/hakamma.py
new file mode 100644
index 0000000..575bc60
--- /dev/null
+++ b/Level1/Lessons72410/hakamma.py
@@ -0,0 +1,28 @@
+신규 아이디 추천
+
+def solution(new_id):
+    answer = ''
+    new_id = new_id.lower()
+    
+    for word in new_id:
+        if word.isalpha() or word.isdigit() or word in '-' or word in '.' or word in '_':
+            answer += word
+    
+            
+    while '..' in answer:
+        answer = answer.replace('..', '.')
+    
+    answer = answer.strip('.')
+
+    if answer == '':
+        answer = 'a'
+    
+    if len(answer)>=16:
+        answer = answer[:15]
+        if answer[-1] == '.':
+            answer = answer[:-1]
+    
+    if len(answer)<=2:
+        answer = answer + answer[-1] * (3-len(answer))
+    
+    return answer
\ No newline at end of file
diff --git a/Level1/Lessons77884/hakamma.py b/Level1/Lessons77884/hakamma.py
new file mode 100644
index 0000000..08135f2
--- /dev/null
+++ b/Level1/Lessons77884/hakamma.py
@@ -0,0 +1,17 @@
+#77884 ����� ������ ����
+
+def solution(left, right):
+    answer = 0
+    
+    for i in range(left, right+1):
+        num = 0
+        for j in range(1, i+1):
+            if i % j == 0:
+                num += 1
+                
+        if num % 2 == 0:
+            answer += i
+        else:
+            answer -= i
+    
+    return answer
\ No newline at end of file
diff --git a/Level2/Lessons12939/hakamma.py b/Level2/Lessons12939/hakamma.py
new file mode 100644
index 0000000..da63091
--- /dev/null
+++ b/Level2/Lessons12939/hakamma.py
@@ -0,0 +1,15 @@
+#12939 �ִ񰪰� �ּڰ�
+
+def solution(s):
+    answer = ''
+    new_s = s.split(' ')
+    max_num = int(new_s[0])
+    min_num = int(new_s[0])
+    for i in range(len(new_s)):
+        num = int(new_s[i])
+        if num > max_num:
+            max_num = num
+        if num < min_num:
+            min_num = num
+    answer = str(min_num) + ' ' + str(max_num)
+    return answer
\ No newline at end of file
diff --git a/Level2/Lessons12941/hakamma.py b/Level2/Lessons12941/hakamma.py
new file mode 100644
index 0000000..eae34bf
--- /dev/null
+++ b/Level2/Lessons12941/hakamma.py
@@ -0,0 +1,11 @@
+#12941 �ּڰ� �����
+
+def solution(A,B):
+    answer = 0
+    A.sort()
+    B.sort(reverse=True)
+    
+    for i in range(len(A)):
+        answer += A[i] * B[i]
+    
+    return answer
\ No newline at end of file
diff --git a/Level2/Lessons12945/hakamma.py b/Level2/Lessons12945/hakamma.py
new file mode 100644
index 0000000..806f67a
--- /dev/null
+++ b/Level2/Lessons12945/hakamma.py
@@ -0,0 +1,10 @@
+#12945 �Ǻ���ġ ��
+
+def solution(n):
+    answer = 0
+    num = [0]*(n+1)
+    num[1] = 1
+    for i in range(2, n+1):
+        num[i] = num[i-1] + num[i-2]
+    answer = num[n] % 1234567
+    return answer
\ No newline at end of file
diff --git a/Level2/Lessons12949/hakamma.py b/Level2/Lessons12949/hakamma.py
new file mode 100644
index 0000000..9c2b288
--- /dev/null
+++ b/Level2/Lessons12949/hakamma.py
@@ -0,0 +1,13 @@
+#12949 ����� ����
+
+def solution(arr1, arr2):
+    answer = []
+    for i in range(len(arr1)):
+        row = []
+        for j in range(len(arr2[0])):
+            mul_result = 0
+            for k in range(len(arr1[0])):
+                mul_result += arr1[i][k] * arr2[k][j]
+            row.append(mul_result)
+        answer.append(row)
+    return answer
\ No newline at end of file
diff --git a/Level2/Lessons12951/hakamma.py b/Level2/Lessons12951/hakamma.py
new file mode 100644
index 0000000..fa48dfe
--- /dev/null
+++ b/Level2/Lessons12951/hakamma.py
@@ -0,0 +1,14 @@
+#12951 JadenCase ���ڿ� �����
+
+def solution(s):
+    answer = ''
+    num = 0
+    for i in range(len(s)):
+        if s[i] == ' ':
+            answer += s[i]
+            num = i+1
+        elif i == num:
+            answer += s[i].upper()
+        else:
+            answer += s[i].lower()
+    return answer
\ No newline at end of file
diff --git a/Level2/Lessons12953/hakamma.py b/Level2/Lessons12953/hakamma.py
new file mode 100644
index 0000000..9b27b7f
--- /dev/null
+++ b/Level2/Lessons12953/hakamma.py
@@ -0,0 +1,16 @@
+#12953 N���� �ּҰ����
+
+def solution(arr):
+    answer = 0
+    max_num = 1
+    for i in range(len(arr)):
+        max_num *= arr[i]
+    
+    for a in range(2, max_num+1):
+        for i in range(len(arr)):
+            if a%arr[i] != 0:
+                break
+        else:
+            answer = a
+            break
+    return answer
\ No newline at end of file