Problem:


Score : 300 points

Problem Statement

Snuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.

Snuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:

Operation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.

For example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.
If the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.
Besides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.

Find the minimum number of operation Snuke needs to perform in order to score at least x points in total.

Constraints

1 ≦ x ≦ 10^{15}

x is an integer.

Input

The input is given from Standard Input in the following format:

x

Output

Print the answer.

Sample Input 1

7

Sample Output 1

2

Sample Input 2

149696127901

Sample Output 2

27217477801



Sample input:
7


Sample output:
2

Submission status: Wrong Answer

Solution code:
"""
10**15なので，ループで割ることを考える
1 + (6, 5)
"""

x = int(input())
count = 0
if x == 1:
    print(count)
    exit()
else:
    x -= 1
    count += 1

count += (x // 11) * 2
x = x % 11

if x < 6:
    print(count)
else:
    print(count + 1)

Submission status: Wrong Answer

Solution code:
"""
10**15なので，ループで割ることを考える
1 + (6, 5)
"""

x = int(input())
count = 0
if x == 1:
    print(count)
    exit()
else:
    x -= 1
    count += 1

count += (x // 11) * 2
x = x % 11

if x == 0:
    print(count)
elif x >= 6:
    print(count + 2)
else:
    print(count + 1)

Submission status: Wrong Answer

Solution code:
"""
10**15なので，ループで割ることを考える
1 + (6, 5)
"""

x = int(input())
count = 0
if x == 1:
    print(count)
    exit()
else:
    x -= 1
    count += 1

count += (x // 11) * 2
x = x % 11

if x == 0:
    print(count)
else:
    print(count + 1)

Submission status: Wrong Answer

Solution code:
"""
10**15なので，ループで割ることを考える
1 + (6, 5)
"""

x = int(input())
count = 0
if x == 1:
    print(count)
    exit()
else:
    x -= 1
    count += 1

count += (x // 11) * 2
x = x % 11

# if x == 1 or x == 8 or x == 9:
#     count += 2
# elif x == 7 or x == 10:
#     count += 3
# elif x == 0:
#     print(count)
#     exit()
# else:
#     count += 1

print(count)

Submission status: Wrong Answer

Solution code:
"""
10**15なので，ループで割ることを考える
1 + (6, 5)
"""

x = int(input())
count = 0
if x == 1:
    print(count)
    exit()
else:
    x -= 1
    count += 1

count += (x // 11) * 2
x = x % 11

if x == 1 or x == 8 or x == 9:
    count += 2
elif x == 7 or x == 10:
    count += 3
elif x == 0:
    print(count)
    exit()
else:
    count += 1

print(count)

Submission status: Wrong Answer

Solution code:
"""
10**15なので，ループで割ることを考える
1 + (6, 5)
"""

x = int(input())
count = 0
if x == 1:
    print(count)
    exit()
else:
    x -= 1
    count += 1

count += (x // 11) * 2
x = x % 11
print(x)
if x == 1 or x == 8 or x == 9:
    count += 2
elif x == 7 or x == 10:
    count += 3
elif x == 0:
    print(count)
    exit()
else:
    count += 1

print(count)

Submission status: Wrong Answer

Solution code:
import sys

x = int(sys.stdin.readline().strip())

"""
1
5423
6
"""

r = x // 11
res = x - 11*r
if res == 0:
    print(2*r)
if res > 6:
    print(2*r + 2)
else:
    print(2*r + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
a = x // 11
b = x % 11
if b == 0:
    print(2 * a)
if b > 6:
    print(2 * a + 2)
else:
    print(2 * a + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
a = x // 11
b = x % 11
if b > 6:
    print(2 * a + 2)
else:
    print(2 * a + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
print(x//11*2+int(x%11>6)+1)

Submission status: Wrong Answer

Solution code:
import sys
import re
import math
import collections
import decimal
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal

sys.setrecursionlimit(10000001)
INF = sys.maxsize
MOD = 10 ** 9 + 7

ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))


# ===CODE===
def main():
    x = ni()

    base = x // 11 * 2
    mod = x % 11
    if mod == 0:
        hoge = 0
    elif mod > 5:
        base += 2
    else:
        base += 1

    print(base)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
import re
import math
import collections
import decimal
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal

sys.setrecursionlimit(10000001)
INF = sys.maxsize
MOD = 10 ** 9 + 7

ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))


# ===CODE===
def main():
    x = ni()
    
    base=x//11*2
    mod = x%11
    if mod > 5:
        base+=2
    else:
        base+=1
    
    print(base)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
#  = input()
x  = int(input())
#  = map(int, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
# c = collections.Counter()

print((x // 11 + 1) * 2 - (0 if (x + 1) % 11 > 6 else 1))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
#  = input()
x  = int(input())
#  = map(int, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
# c = collections.Counter()

print((x // 11 + 1) * 2 - (0 if x % 11 > 6 else 1))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

x = int(input())

tmp = 0
if x % 11 < 7:
    tmp = 1
else:
    tmp = 2
print(x//11 * 2 + tmp)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

x = int(input())

if x <= 11:
    print(2)
else:
    print(x//11 * 2 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())

c = x // 11

if c * 11 == x:
    print(c * 2)
elif c * 11 + 5 >= x:
    print(c * 2 + 1)
else:
    print(c * 2 + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

c = x // 11
m = x % 11
if m > 5:
    ans = c * 2 + 2
elif m > 0:
    ans = c * 2 + 1
else:
    ans = c * 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

c = x // 11
m = x % 11
if m > 5:
    ans = c * 2 + 2
else:
    ans = c * 2 + 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())-1
ans = 2 * (x // 11)
if x % 11 > 5:
  ans += 2
elif 0 < x % 11 and x % 11 < 6:
  ans += 1
  
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = 2 * (x // 11)
if x % 11 > 5:
  ans += 2
elif 0 < x % 11 and x % 11 < 6:
  ans += 1
  
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline


def main():
    x = int(input())

    q, r, = divmod(x, 11)
    if r <= 6:
        ans = 2 * q + 1
    else:
        ans = 2 * q + 2

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

if x<=6:
    print(1);exit()
if x<=11:
    print(2);exit()
ans=(x//11)*2
b = x-x//11*11
if 0<b<=6:
    ans+=1
else:
    ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x<=6:
    print(1);exit()
if x<=11:
    print(2);exit()
ans=(x//11)*2
b = x-x//11*11
if b<=6:
    ans+=1
else:
    ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
from math import ceil
x = int(input())
print((x // 11) * 2 + 2 if x % 11 > 6 else (x // 11) * 2 + 1)

Submission status: Wrong Answer

Solution code:
from math import ceil
x = int(input())
print(ceil(x / 11) * 2 + (x % 11) // 6 - 1)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(n//11*2+(n%11>0)+(n%11>5))

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
def main():
    x = int(input())
    ans = (x//11)*2
    if x % 11 > 6:
        ans += 2
    else:
        ans += 1
    print(ans)
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    x = int(input())
    answer = (x // 11) * 2
    if 0 <= x % 11 <= 6:
        answer += 1
    elif 7 <= x % 11:
        answer += 2
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    x = int(input())
    answer = (x // 11) * 2
    if x % 11 <= 6:
        answer += 1
    elif 7 <= x % 11:
        answer += 2
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    x = int(input())
    answer = (x // 11) * 2
    x -= (answer // 2) * 11
    if 0 <= x <= 6:
        answer += 1
    elif 7 <= x <= 11:
        answer += 2
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    x = int(input())
    answer = (x // 11) * 2
    x -= (answer // 2) * 11
    if x <= 6:
        answer += 1
    else:
        answer += 2
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys

def main():
    x = int(input())
    if x % 11 > 6:
        print(2*(x//11) + 2)
    else:
        print(2*(x // 11) + 1) 

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 == 0:
    ans = x // 11 * 2
else:
    if x % 11 <= 6:
        ans = x // 11 * 2
    else:
        ans = (x // 11 + 1) * 2

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
tmp = x // 11 + 1
ans = tmp * 2
if x <= 11 * tmp - 5:
    ans -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

x = I()
y = x % 11
ans = (x // 11) * 2
if y <= 6:
    ans += 1
else:
    ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    x = int(input())

    q, r = divmod(x, 11)
    ans = q * 2 + (1 if r <= 6 else 2)
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())
if x<11:
    print(1 if x <= 6 else 2)
else:
    ans = x // 11 * 2
    x -= (x // 11) * 11
    if x <= 6:
        ans += 1
    else:
        ans += 2
    print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x<11:
    print(1 if x <= 6 else 2)
else:
    t = x // 11
    t += t
    if t % 11 != 0:
        t += 1
    print(t)

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
ans = math.ceil(x / 5.5)
if x < 7 :
    ans = 1
print(ans)

Submission status: Wrong Answer

Solution code:
import math
print(math.ceil(int(input()) / 5.5))

Submission status: Wrong Answer

Solution code:
x=int(input())
cnt=(x//11)*2
if x%11 >5:
    cnt+=2
elif 0< x%11 <=5:
    cnt+=1

print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())
right = int(x//11)+1
if right*11 - x < 5:
    print(right*2)
else:
    print(right*2-1)

Submission status: Wrong Answer

Solution code:
def I(): return int(input())
x = I()
div,mod = divmod(x,11)
print(div*2+(1 if mod<=6 else 2))

Submission status: Wrong Answer

Solution code:
x = int(input())
s, r = divmod(x, 11)
s *= 2
s += 2 if r > 6 else 1
print(s)

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

temp = math.floor(N / 11)
rest = N % 11

print((temp * 2) + math.ceil(rest / 5))

Submission status: Wrong Answer

Solution code:
si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lmii = lambda: list(map(int, input().split()))
lmsi = lambda: list(map(str, input().split()))
smii = lambda: sorted(map(int, input().split()))

# ----------

x = ii()

d = x // 11
m = x % 11
ans = 2 * d
if m > 0:
    ans += 1
    if m > 5:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    x = int(input())
    ans = (x // 11) * 2
    if x % 11 == 0:
        pass
    elif x % 11 <= 5:
        ans += 1
    else:
        ans += 2
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lmii = lambda: list(map(int, input().split()))
lmsi = lambda: list(map(str, input().split()))
smii = lambda: sorted(map(int, input().split()))

# ----------

x = ii()

d, m = divmod(x, 11)

ans = 2 * d
if m > 0:
    ans += 1
    if m > 5:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = x//11 * 2
if 0 < x%11 <= 5: ans += 1
elif x % 11 >= 6: ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = x//11 * 2
if 0 < x%11 < 5: ans += 1
else: ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
def I(): return int(input())
x = I()
div,mod = divmod(x,11)
print(div*2 + 1 if mod<=6 else 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

num = x // 11

x %= 11
if x == 0:
    print(num * 2)
else:
    print(num * 2 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
n = x//11
k = x%11
if k<=6:
    print(2*n+1)
else:
    print(2*n+2)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=1
if n%11>6:
  ans+=1
k=n//11
if (k+1)*11<=n:
  k+=1
print(2*k+ans)

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X = INT()

# while 
a = ceil(X / 5.5)
print(a)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = x//11 * 2
if x%11 < 5: ans += 1
else: ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=1
if n%11>6:
  ans+=1
print(2*(n//11)+ans)

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

n = int(readline())
ans = n // 11 * 2 + 1
if not 1 <= n % 11 <= 6:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

n = int(readline())
ans = n // 11 * 2 + 1
if not 1 <= n % 11 <= 5:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())
a=x//11
p,q=divmod(x,11)
if q<=6:
  print(p*2+1)
else:
  print(p*2+2)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 > 6:
    print((x//11)*2 + 2)
else:
    print((x//11)*2 + 1)

Submission status: Wrong Answer

Solution code:
x=int(input())
if x%11>0:
  ans=2*(x//11)+((x%11)//6)+1
else:
  ans=2*(x//11)
print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=2*(x//11)+((x%11)//6)+1
print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=2*(x//11)+((x%11)//6)+(x%11)%6
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

cnt = (x // 11 * 11) * 2
x -= x // 11 * 11

if x <= 6:
    cnt += 1
else:
    cnt += 2

print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x <= 5:
    print(1)
elif x <= 11:
    print(2)
else:
    ans = (x//11)*2
    if x % 11 != 0:
        ans += 1
    if x % 11 >= 6:
        ans += 1
    print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x%11 <= 6:
    print((x//11)*2 + 1)
else:
    print((x//11)*2 + 2)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x%11 <= 6:
    print((x//11)*2 + 1)
else:
    print((x//11)*2 * 2)

Submission status: Wrong Answer

Solution code:
x=int(input())

if x%11==0:
    print((x//11)*2)
    exit()

if 0<x%11<6:
    print((x//11)*2+1)
    exit()

print((x//11)*2+2)

Submission status: Wrong Answer

Solution code:
x=int(input())
x11=(-(-x//11)-1)*2
x11_2=x11*11
if(x<=x11_2+6):
    print(x11+1)
else:
    print(x11+2)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans1 = x//11
ans2 = x%11
if ans2 > 6:
    ans2 = 2
else:
    ans2 = 1
print(2*ans1+ans2)

Submission status: Wrong Answer

Solution code:
def main():
    X = int(input())
    ans = 0
    ans += X//11
    X %= 11
    if 6 < X:
        ans += 2
    elif 1 < X:
        ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    X = int(input())
    ans = 0
    ans += X//11
    X %= 11
    if 6 < X:
        ans += 2
    else:
        ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=(x//11)*2+1
amari=x%11
if amari>6:
  ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

n_11 = x // 11

x_tmp = x % 11

if x_tmp >= 6:
    ans = 2 * n_11 + 2
else:
    ans = 2 * n_11 + 1

print(ans)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = INT()

ans = 2*(x//11)
x %= 11
if 1 <= x <= 6:
    ans += 1
else:
    ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
X = int(input())
d,m = divmod(X-1,12)
ans = 1 + d*2 + (m>=6)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = INT()

ans = 2*(x//11)
x %= 11
if x <= 6:
    ans += 1
else:
    ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=n//11*2
n%=11
if 1<=n<=5:ans+=1
if 6<=n:ans+=2
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
q, mod = divmod(x, 11)
print(q*2+2 if mod>6 else q*2+1)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = (x // 11) * 2
sub = x % 11
if sub >= 7:
    ans += 2
else:
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = (x // 11) * 2
sub = x % 11
if sub <= 6:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = (x / 11) * 2
sub = x % 11
if sub <= 6:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

abc = [5, 6]
ans = (x // 11) * 2
sub = x % 11
if sub <= 5:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
if 1 <= x <= 6:
    print(1)
    exit()
elif 6 < x < 11:
    print(2)
    exit()
if (x%11) == 0:
    print((x//11)*2)
elif (x%11) != 6:
    print((x//11) * 2 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = 0
cnt += x // 11 * 2
x %= 11
if 1 <= x <= 5:
    cnt += 1
elif 6 <= x <= 10:
    cnt += 2
print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())
q, r = divmod(x, 11)
if r > 6:
    ans = 2*q+2
else:
    ans = 2*q+1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x%11 > 6:
    ans = x//11 *2 +2
elif x %11==0:
    ans = x//11
else:
    ans = x//11 *2 +1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
x,y=divmod(x, 11)
if y > 6:
    print(x+2)
elif y > 0:
    print(x+1)
else:
    print(x)

Submission status: Wrong Answer

Solution code:
x = int(input())
a = x // 11

if 0 < a * 11 < x:
  ans = a * 2 + 1
  if a * 11 + 5 < x:
    ans += 1
else: ans = a * 2
if a == 0:
  if 6 > x: ans = 1
  elif 11 >= x: ans = 2

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = n // 11
m = n % 11

ans *= 2
if m > 6:
    ans += 2
else:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
if x%11 > 6:
    if x//11==0:
        ans = 2
    else:
        ans = (x//11+1) *2
else:
    if x//11==0:
        ans = 1
    else:
        ans = (x//11+1)*2 -1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = n // 11
m = n % 11

ans *= 2
if m >= 6:
    ans += 2
else:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = x // 11

if 0 < ans * 11 < x:
  ans = ans * 2 + 1
else: ans = ans * 2
if ans == 0:
  if 6 > x: ans = 1
  elif 11 > x: ans = 2

print(ans)

Submission status: Wrong Answer

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    X = int(input())
    if X % 11 <= 6: print(((X - 1) // 11 + 1) * 2 - 1)
    else: print(((X - 1) // 11 + 1) * 2)

    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
x = int(input())
mod = 10 ** 9 + 7
tmp = x // 11
nokori = x % 11
if nokori > 6:
    print((tmp * 2 + 2) % mod)
else:
    print((tmp * 2 + 1) % mod)

Submission status: Wrong Answer

Solution code:
x = int(input())

tmp = x // 11
nokori = x % 11
if nokori > 6:
    print(tmp * 2 + 2)
else:
    print(tmp * 2 + 1)

Submission status: Wrong Answer

Solution code:
# 奇数回目 -> 6
# 偶数回目 -> 5
x = int(input())

p,q = divmod(x, 11)
if q == 0:
    pass
elif q <= 6:
    p += 1
else:
    p += 2

print(p)

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = 1
if x % 11 >= 7:
    cnt += 1
cnt += int(x/11) * 2
print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = x // 11 * 2
if x % 11 >= 7:
    ans += 2
else:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = x // 11 * 2 + (x % 11) // 6 + 1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

x = INT()
ans = x // 11 * 2
tmp = x % 11
if tmp <= 6:
    ans += 1
else:
    ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
from math import ceil

n = int(input())
ans = ceil(n / 11) * 2
rem = n % 11
if rem > 5:
    print(ans)
else:
    print(ans - 1)

Submission status: Wrong Answer

Solution code:
def resolve():
    x=int(input())
    q,mod=divmod(x,11)
    if mod==0:
        print(q*2)
    elif 1<=mod<=6:
        print((q+1)*2-1)
    else:
        print((q+1)*2)





#resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    x=int(input())
    q,mod=divmod(x,11)
    if mod==0:
        print(q*2)
    elif 1<=mod<=5:
        print((q+1)*2-1)
    else:
        print((q+1)*2)





resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    x=int(input())
    q,mod=divmod(x,11)
    if mod<=5:
        print((q+1)*2-1)
    else:
        print((q+1)*2)




resolve()

Submission status: Wrong Answer

Solution code:
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations, combinations, product, accumulate, groupby
from heapq import heappush, heappop
from collections import deque, defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 7)
# import numpy as np

inf = 10 ** 20
INF = float("INF")
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]
ddn9 = ddn + [(0, 0)]
'''for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:'''
"""


def main():
    x = int(input())
    if 1 <= x <= 6:
        print(1)
    elif 6 < x <= 11:
        print(2)
    elif x % 11 ==0:
        print(x // 11 * 2)
    else:
        print(x // 11 * 2 + 1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations, combinations, product, accumulate, groupby
from heapq import heappush, heappop
from collections import deque, defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 7)
# import numpy as np

inf = 10 ** 20
INF = float("INF")
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]
ddn9 = ddn + [(0, 0)]
'''for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:'''
"""


def main():
    x = int(input())
    if 1 <= x <= 6:
        print(1)
    elif 6 < x <= 11:
        print(2)
    else:
        print(x // 11 * 2 + 1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

if(x%11 <= 6):
    print(((x//11)+1)*2-1)
else:
    print(((x//11)+1)*2)

Submission status: Wrong Answer

Solution code:
x = int(input())

if(1 <= x <= 6):
    print(1)
elif(x <= 11):
    print(2)
else:
    if((x//11)*11 < x):
        print(((x//11)+1)*2-1)
    else:
        print((x//11)*2)

Submission status: Wrong Answer

Solution code:
x = int(input())
d, m = x // 11, x % 11
ans = d * 2
if m > 5:
  ans += 2
elif m > 0:
  ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
d, m = divmod(x, 11)
ans = d * 2
if m > 5:
  ans += 2
elif m > 0:
  ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math
input = sys.stdin.readline

n = int(input())
ans = math.ceil(n / 11 * 2)
print(ans)

Submission status: Wrong Answer

Solution code:
# 大きくなるように取る
# 1 -> 5 -> 6 -> 5かな
# 1 6 12 17 23
N = int(input())
# N -= 1
cnt = 0
a = N // 11
amari = N % 11
cnt += a*2
# print(a, amari)
if amari == 0:
    cnt += 0
elif amari <= 5:
    cnt += 1
else:
    cnt += 2
print(cnt)

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=0
chk=0
ans=ans+(x//11)*2
chk=x%11
if chk>6:
	ans=ans+2
if chk>0:
	ans=ans+1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 == 0:
    print(x // 11 * 2)
if x % 11 > 6:
    print(x // 11 * 2 + 2)
else:
    print(x // 11 * 2 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 == 0:
    print(x // 11 * 2)
if x % 11 > 5:
    print(x // 11 * 2 + 2)
else:
    print(x // 11 * 2 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 > 5:
    print(x // 11 * 2 + 2)
else:
    print(x // 11 * 2 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 > 5:
    print(x // 11 + 2)
else:
    print(x // 11 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 2*x // 11
if ans + 5 < x or 1 <= x <= 6:
  ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 2*x // 11
if ans + 5 < x or 1 <= x <= 5:
  ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 2*x // 11
if ans + 5 < x:
  ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
#最初に5を上にした状態で、6にする→5にする→6にする・・をするのが一番効率的
#つまり、xが6以下であれば回数は1回、7以上であれば11で割る
ans = 0
if x <= 6:
  ans = 1
else:
  if x <= 11:
    ans = 2
  else:
    #6と5の面を上にするので、回数としては2回となるため2倍
    ans = (x // 11) * 2
    if not x % 11 == 0:
      ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
x = int(input())

if x <= 6:
    print(1)
    exit()
if 6 < x <= 11:
    print(2)
    exit()
ans = (x // 11)
point = ans * 11
ans *= 2
#print(point)
while point < x:
    if ans % 2 == 0:
        point += 5
        ans += 1
    elif ans % 2 == 1:
        point += 6
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
x = int(input())

ans = (x // 11)
point = ans * 11
if point >= x:
    print(ans * 2)
    exit()
ans *= 2
#print(point)
while point < x:
    if ans % 2 == 0:
        point += 5
        ans += 1
    elif ans % 2 == 1:
        point += 6
        ans += 1
print(ans)