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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from functools import reduce


INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007



x = I()
print(x // 11 * 2 + 1 + bool(x % 11 > 6))

Submission status: Wrong Answer

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


def solve(x: int):

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

    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    solve(x)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


def solve(x: int):

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

    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    solve(x)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())

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

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X = int(input())

tmp = X // 11
ans = 0
ans += tmp * 2

X %= 11

if 1 <= X <= 6:
	ans += 1
else:
	ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
X = int(input())

ans = 1
X -= 6
ans += 2*(X // 11)

X -= (ans//2) * 11

if 1 <= X <= 5:
	ans += 1
else:
	ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
X = int(input())

ans = 0
ans += 2*(X // 11)

X -= (ans//2) * 11

if 1 <= X <= 6:
	ans += 1
else:
	ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
X = int(input())

ans = 0
ans += 2*(X // 11)

X -= (ans//2) * 11

if X <= 6:
	ans += 1
else:
	ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
X = int(input())

ans = 0
ans += 2*(X // 11)

X -= ans * 11

if X <= 6:
	ans += 1
else:
	ans += 2

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
if N < 7:
    print(1)
    exit()
elif N < 12:
    print(2)
    exit()

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

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
if N < 7:
    print(1)
    exit()
elif N < 11:
    print(2)
    exit()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
count = 0
sum = 0
while sum<x:
    sum+=11
    count+=2
if sum-6>=x:
    count-=1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X = int(input())
tmp1 = (X//11)*2
tmp2 = X%11
if tmp2<7:
    print(tmp1+1)
elif tmp2>6 and tmp2<12:
    print(tmp1+2)
else:
    print(tmp1)

Submission status: Wrong Answer

Solution code:
X = int(input())

cnt = 0

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/abc053/tasks/arc068_a
# C - X: Yet Another Die Game
import math
n = int(input().split()[0])

# 1度6にしたら、延々と横に回し続けるのが最善

c = math.floor(n / 11) * 2

if n % 11 == 0:
    pass
elif n % 11 <= 5:
    c += 1
elif n % 11 >= 6:
    c += 2

print(int(c))

Submission status: Wrong Answer

Solution code:
# 最初上をむいてる数はなんでもいいっぽいので6と5をこの順番で繰り返し貪欲するのがいい
# 6まで -> 1回 11まで -> 2回 17まで -> 3回 22まで -> 4回  28まで -> 5回...
x = int(input())
if x <= 6:
    print(1)
elif x <= 11:
    print(2)
else:
    print((x // 11) * 2 + (2 if (x % 11) >= 6 else 1 if (x % 11) >= 1 else 0))

Submission status: Wrong Answer

Solution code:
# 最初上をむいてる数はなんでもいいっぽいので6と5をこの順番で繰り返し貪欲するのがいい
# 6まで -> 1回 11まで -> 2回 17まで -> 3回 22まで -> 4回  28まで -> 5回...
x = int(input())
if x <= 6:
    print(1)
elif x <= 11:
    print(2)
else:
    print((x // 11) * 2 + (1 if x % 11 > 0 else 0))

Submission status: Wrong Answer

Solution code:
# 最初上をむいてる数はなんでもいいっぽいので6と5をこの順番で繰り返し貪欲するのがいい
# 6まで -> 1回 11まで -> 2回 17まで -> 3回 22まで -> 4回  28まで -> 5回...
x = int(input())
if x <= 6:
    print(1)
elif x <= 11:
    print(2)
else:
    print((x // 11) * 2 + (1 if x // 11 > 0 else 0))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i=int(input())
print(2*((i-1)//11)+1+((i-1)%11)//7)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
n = (2*(x+3))//11+ 1
m = (2*x)//11 + 1

print(max(n,m))

Submission status: Wrong Answer

Solution code:
x=int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())
count=0


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    x = inputInt()
    
    ans = (x // 11) * 2
    if x % 11 > 0:
        ans+=1
    if x % 11 > 5:
        ans+=1
    print(ans)
            
            
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    x = inputInt()
    
    if x <= 6:
        print(1)
        sys.exit()
    if x <= 11:
        print(2)
        sys.exit()
    
    ans = (x // 11) * 2
    if x % 11 > 0:
        ans+=1
    print(ans)
            
            
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(int(-(-(int(input()))//5.5)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:



x = int(raw_input())


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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = 0
if x <= 6:
    cnt = 1
else:
    if 7 <= x <= 11:
        cnt = 2
    else:
        p = x // 11
        q = x % 11
        if 1 <= q <= 6:
            cnt = 2*p + 1
        else:
            cnt = 2*p + 2

print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = 0
if x <= 6:
    cnt = 1
else:
    if 7 <= x <= 11:
        cnt = 2
    else:
        p = x // 11
        q = x % 11
        if q <= 6:
            cnt = 2*p + 1
        else:
            cnt = 2*p + 2

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

def solve(X):
    q,r = divmod(X, 11)
# (5,6)

    if r == 0:
        return (q*2)
    elif r <= 6:
        return (q*2+1)
    else:
        return (q*2+2)

for i in range(22):
    print(i,solve(i))

X = int(input())

Submission status: Wrong Answer

Solution code:
X = int(input())

q,r = divmod(X, 11)
# (5,6)

if r == 0:
    print(q*2)
elif r <= 5:
    print(q*2+1)
else:
    print(q*2+2)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools


def solve(x: int):
    if x <= 5:
        print(1)
    else:
        m = (x-5) // 11
        if (x - 5) % 11 == 0:
            print(2 * m + 1)
        elif x - 5 <= 11 * m + 6:
            print(1 + (2 * m + 1))
        else:
            print(1 + (2 * m + 2))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    solve(x)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools


def solve(x: int):
    if x <= 5:
        print(1)
    else:
        m = (x-5) // 11
        if x - 5 <= 11 * m + 6:
            print(1 + (2 * m + 1))
        else:
            print(1 + (2 * m + 2))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    solve(x)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())


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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())
print(-(int(-x*2//11)))

Submission status: Wrong Answer

Solution code:
x=int(input())
print(int(-(-x//5.5)))

Submission status: Wrong Answer

Solution code:
x=float(input())
print(int(-(-x//5.5)))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    x = II()
    if x < 1200:
        print("ABC")
    else:
        print("ARC")
    return

#B
def B():
    s = S()
    a = inf
    z = 0
    for num,si in enumerate(s):
        if si == "A":
            a = min(a, num)
        if si == "Z":
            z = max(z, num)
    print(z-a+1)
    return

#C
def C():
    x = II()
    if 1 <= x <= 6:
        print(1)
        return
    print(x // 11 * 2 + (x % 11) // 6 + (x % 11 != 0))
    return

#D
def D():
    return

#Solve
if __name__ == '__main__':
    C()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    x = II()
    if x < 1200:
        print("ABC")
    else:
        print("ARC")
    return

#B
def B():
    s = S()
    a = inf
    z = 0
    for num,si in enumerate(s):
        if si == "A":
            a = min(a, num)
        if si == "Z":
            z = max(z, num)
    print(z-a+1)
    return

#C
def C():
    x = II()
    print(x // 11 * 2 + (x % 11) // 6 + (x % 11 != 0))
    return

#D
def D():
    return

#Solve
if __name__ == '__main__':
    C()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
print(math.ceil((2 * 149696127901 - 1) / 11))

Submission status: Wrong Answer

Solution code:
def abc053c(x: int):
    y = int(x / 11)
    m = x - (y * 11)
    return y * 2 + 1 + int(m / 6)


if __name__ == '__main__':
    print(abc053c(int(input())))

Submission status: Wrong Answer

Solution code:
i = int(input())
print(i*2//11 if i%11==6 else i*2//11+1)

Submission status: Wrong Answer

Solution code:
i = int(input())
print(i*2//11+1)

Submission status: Wrong Answer

Solution code:
import math

INF = 10**9+7
PRIME_NUM = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]

def main():
	n = int(input())
	ans = 0
	ans=2*(int(n/11))
	n=n-ans*11
	if(n>6): ans+=2
	else: ans+=1
	print(ans)


main()

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x=int(input())
c=(x//11)*2
a=x%11
if a<=5 and a!=0:c+=1
elif a<11 and a!=0:c+=2
print(c)

Submission status: Wrong Answer

Solution code:

from decimal import *
X = input()

x = Decimal(X)

ans = Decimal("0")

ans += 2 * ( x // 11 )


if x % 11 != 0 and x % 11 <= 5:
    ans += 1

elif x % 11 != 0:
    ans += 2

print ('{:.18g}'.format(ans))

Submission status: Wrong Answer

Solution code:

x = int(input())

ans = 0

ans += 2 * ( x // 11 )


if x % 11 != 0 and x % 11 <= 5:
    ans += 1

elif x % 11 != 0:
    ans += 2

print (ans)

Submission status: Wrong Answer

Solution code:

x = int(input())

ans = 0

ans += 2 * ( x // 11 )


if x % 11 != 0 and x % 11 <= 5:
    ans += 1

elif x % 11 != 0:
    ans += 2

print (ans)

Submission status: Wrong Answer

Solution code:

x = int(input())

ans = 0

ans += 2 * ( x // 11 )


if x % 11 <= 5:
    ans += 1

else:
    ans += 2

print (ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

if N <= 5:
  print(1)
elif N <= 11:
  print(2)
else:
  x,y = divmod(N,11)
  if y == 0:
    print(x * 2)
  else:
    print(x * 2 + 1)

Submission status: Wrong Answer

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

x = int(input())
a = x // 11
b = x - 11*a
if b > 5:
    print(2*a + 2)
elif x % 11 == 0:
    print(2*a)
else:
    print(2*a + 1)

Submission status: Wrong Answer

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

x = int(input())
a = x // 11
b = x - 11*a
if b > 5:
    print(2*a + 2)
else:
    print(2*a + 1)

Submission status: Wrong Answer

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

x = int(input())
a = x // 11
b = x - 11*a
if b >= 5:
    print(2*a + 2)
else:
    print(2*a + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())

cnt = 0
if x % 11 == 0:
    cnt = x // 11
elif 1 <= x % 11 <= 6:
    cnt = x // 11 + 1
elif 7 <= x % 11 <= 10:
    cnt = x // 11 + 2

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())

ans=x/11*2

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

Submission status: Wrong Answer

Solution code:
x=int(input())

ans=x/11

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

Submission status: Wrong Answer

Solution code:
X = int(input())
k = X//11 * 2
l = X%11
if X == 1:
    print(0)
else:
    if l == 0:print(k)
    elif l <= 5:print(k+1)
    else:print(k+2)

Submission status: Wrong Answer

Solution code:
X = int(input())
k = X//11 * 2
l = X%11
if l == 0:print(k)
elif l <= 5:print(k+1)
else:print(k+2)

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

dice = [1,2,3,4,5,6]

x = int(input())

times = math.floor(Decimal(x)/Decimal(11))
amari = x%11

if amari >= 6:
    ans = 2*times + 2
elif amari >= 1:
    ans = 2*times + 1
else:
    ans = 2*times
print(ans)

Submission status: Wrong Answer

Solution code:
import math

dice = [1,2,3,4,5,6]

x = int(input())

times = math.floor(x/11)
amari = x%11

if amari >= 6:
    ans = 2*times + 2
elif amari >= 1:
    ans = 2*times + 1
else:
    ans = 2*times
print(ans)

Submission status: Wrong Answer

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

print (ans)

Submission status: Wrong Answer

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

print (ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
if 11 < x:
    print((x // 11) * 2 +1)
elif 7 < x < 12:
    print("2")
elif x == 7:
    print("3")
else:
    print("1")

Submission status: Wrong Answer

Solution code:
x = int(input())
if 11 < x:
    print((x // 11) * 2 +1)
elif 6 < x < 12:
    print("2")
else:
    print("0")

Submission status: Wrong Answer

Solution code:
x = int(input())
if 11 < x:
    print((x // 11) * 2 +1)
elif 6 < x < 12:
    print("1")
else:
    print("0")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
## 6点、5点を繰り返すのが最適

x = int(input())

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
x = int(input())
#6点5点を交互に得れば良い
print(1 + (x//11)*2 + ((x%11)//7))

Submission status: Wrong Answer

Solution code:
X = int(input())
print(X//11*2+1)

Submission status: Wrong Answer

Solution code:
x=int(input())
print(max(int(x/11)*2+(x%11>0)+(x%11>5),1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

count = 0
buff = x
count = buff // 11
_buff = buff % 11
me = buff // 5.5
_fo = me / 2
_ba = me / 2
se = x - me * 5.5
if _buff >= 7:
    print(int(count+2))
    exit()
elif 7 >= se and se > 0:
    print(int(count+1))
    exit()
    
print(int(count))

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

count = 0
buff = x
count = buff // 11
_buff = buff % 11
me = buff // 5.5
_fo = me / 2
_ba = me / 2
se = x - me * 5.5
if _buff >= 7:
    print(int(count+2))
    exit()
elif 7 > se and se > 0:
    print(int(count+1))
    exit()
    
print(int(count))

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

count = 0
buff = x
count = buff // 11
_buff = buff % 11
me = buff // 5.5
_fo = me / 2
_ba = me / 2
se = x - me * 5.5
if se >= 7:
    print(int(buff//5.5+2))
    exit()
elif 7 > se and se > 0:
    print(int(buff//5.5+1))
    exit()
    
print(int(buff//5.5))

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

count = 0
buff = x
count = buff // 11
_buff = buff % 11
me = buff // 5.5
_fo = me / 2
_ba = me / 2
se = x - me * 5.5
if se > 6:
    print(int(buff//5.5+2))
    exit()
elif 7 > se and se > 0:
    print(int(buff//5.5+1))
    exit()
    
print(int(buff//5.5))

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

count = 0
buff = x
count = buff // 11
_buff = buff % 11
me = buff // 5.5
_fo = me / 2
_ba = me / 2
se = x - me * 5.5
if se > 6:
    print(int(buff//5.5+2))
else:
    print(int(buff//5.5+1))

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

count = 0
buff = x
count = buff // 11
_buff = buff % 11
me = buff // 5.5
_fo = me / 2
_ba = me / 2
se = x - me * 5.5
if me % 2 == 0 and se > 5:
    print(int(buff//5.5+2))
else:
    print(int(buff//5.5+1))

Submission status: Wrong Answer

Solution code:
import math
x = int(input())

count = 0
buff = x
count = buff // 11
_buff = buff % 11

print(int(buff//5.5+1))