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:
import sys
import math

N = int(input())
print(math.ceil((N+1)/11*2))

Submission status: Wrong Answer

Solution code:
import sys
import math

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

Submission status: Wrong Answer

Solution code:
from math import ceil
print(ceil(int(input())*2/11))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Sep 30 01:58:33 2020

@author: liang
"""
import math

x = int(input())

ans = x // 11 *2 + math.ceil(x%11/5)

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = 2 * (x // 11)

if x % 11 < 7:
  ans += 1
else:
  ans += 2
print(ans)

Submission status: Wrong Answer

Solution code:
import math
from math import gcd,pi,sqrt
INF = float("inf")
MOD = 10**9 + 7

import sys
sys.setrecursionlimit(10**6)
import itertools
import bisect
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]


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


if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
from math import gcd,pi,sqrt
INF = float("inf")
MOD = 10**9 + 7

import sys
sys.setrecursionlimit(10**6)
import itertools
import bisect
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]


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



if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
if x % 11 == 0:
  print(math.ceil(x/11)*2)
elif x % 11 <= 5:
  print(math.ceil(x/11)*2-1)
elif 5 < x % 11 < 11:
  print(math.ceil(x/11)*2)

Submission status: Wrong Answer

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

elif 1<=x<=5:
    print(1+2*n)
else:
    print(2+2*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
n=2*a//11+a%11//7+min(1,a%11)
print(n)

Submission status: Wrong Answer

Solution code:
a=int(input())
n=2*a//11+a%11//7+min(0,a%11)
print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
n=int(a/15)+int(a%15/6)+1
if a%15==0:
  n-=1
print(n)

Submission status: Wrong Answer

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

if a <= 6:
    c = 1
else:
    c = 2

print(b * 2 + c)

Submission status: Wrong Answer

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

if a < 6:
    c = 1
else:
    c = 2

print(b * 2 + c)

Submission status: Wrong Answer

Solution code:
N = int(input()) 
num = N // 11
res = num * 2
k = num * 11
if 0< N % 11 <= 5:
  res +=  1
elif 6<= N % 11 <= 10:
  res +=  2
else:
  pass  
print(res)

Submission status: Wrong Answer

Solution code:
N = int(input()) 
num = N // 11
res = 0
k = 0
res = num * 2
k = num * 11
if N % 11 == 0:
  pass
else:
  res +=  1
  k += 5
  if k < N:
    res +=  1
    k += 6
print(res)

Submission status: Wrong Answer

Solution code:
N = int(input()) 
num = N // 11
res = 0
k = 0
res = num * 2
k = res * 11
if N % 11 == 0:
  pass
else:
  res +=  1
  k += 5
  if k < N:
    res +=  1
    k += 6
print(res)

Submission status: Wrong Answer

Solution code:
N = int(input()) 
num = N // 11
res = 0
k = 0
k = res * 11
res = num * 2
if N % 11 == 0:
  pass
else:
  res +=  1
  k += 5
  if k < N:
    res +=  1
    k += 6
print(res)

Submission status: Wrong Answer

Solution code:
N = int(input()) 
num = N // 11
res = 0
k = 0
k = res * 11
if N % 11 == 0:
  res = num * 2
else:
  res = num * 2 + 1
  k += 5
  if k < N:
    res = num * 2 + 1
    k += 6
print(res)

Submission status: Wrong Answer

Solution code:
x = int(input())

if 6 < x < 11:
    print(2)
    exit()
elif 1 <= x <= 6:
    print(1)
    exit()

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

Submission status: Wrong Answer

Solution code:
x = int(input())

cnt = x // 11
cnt += (0 if x % 11 == 0 else 1 if x % 11 <= 6 else 2)

print(cnt)

Submission status: Wrong Answer

Solution code:
x = int(input())

if x % 11 == 0:
    print((x // 11) * 2)
elif x % 11 <= 6:
    print((x // 11) * 2 + 1)
else:
    print((x // 11) * 12 + 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:
N=int(input())
c=(N+10)//11
print(2*c-((N+10)%11<5))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

m = x % 11
if m >= 7:
    ans += 2
elif m >= 1:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = (n // 11) * 2

rem = n % 11
if rem > 0 :
    if rem <= 5:
        ans += 1
    else:
        ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = (n // 11) * 2

rem = n % 11

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x=int(input())
if x<=6:
    print(1)
elif x<=11:
    print(2)
elif x%11<=6:
    print(2*(x//11)+1)
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:
    print(x//11*2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
#
# abc053 b
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """7"""
        output = """2"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """149696127901"""
        output = """27217477801"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Wrong Answer

Solution code:
#
# abc053 b
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """7"""
        output = """2"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """149696127901"""
        output = """27217477801"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

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




if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:

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

    if x <= 6:
        print(1)
    elif x <= 11:
        print(2)
    else:
        kaisuu = x // 11
        amari = x % 11

        print(2 * kaisuu + amari)




if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math


n = int(input())
# nが6以下の場合
if n <= 6:
    print(1)
    exit()

res = n / 11.0
# nが11以上の場合
if res.is_integer():
    print(int(res*2))
else:
    print(int(math.ceil(res)+1))

Submission status: Wrong Answer

Solution code:
import math


n = int(input())
# nが6以下の場合
if n <= 6: 
    print(1)
    exit()

res = n / 11.0
# nが11以上の場合
if res.is_integer():
    print(res*2)
else:
    print(math.ceil(res)+1)

Submission status: Wrong Answer

Solution code:
# C - X: Yet Another Die Game
def main():
    x = int(input())

    if x <= 6:
        print(1)
    elif x <= 11:
        print(2)
    else:
        print(x//11*2+1)
  
        
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# C - X: Yet Another Die Game
def main():
    x = int(input())

    if x <= 11:
        print(2)
    else:
        print(x//11*2+1)
  
        
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
#１回目の操作で最低5点、2回目以降は6点と5点を繰り返す
x = int(input())
#print(x,'/',11,x//11,x%11)
#print(x,'/',5,x//5,x%5)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(raw_input())
c = 2 * (n / 11) if n >= 11 else 0
if n >= 11:
	n%= 11
if n >= 5:
	c+=2
else:
	if n:
		c+=1
print c

Submission status: Wrong Answer

Solution code:

n = int(raw_input())

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

Submission status: Wrong Answer

Solution code:

n = int(raw_input())

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

Submission status: Wrong Answer

Solution code:

n = int(raw_input())
c = 2 * (n / 11)
n%= 11
if n >=5:
	c+=2
else:
	if n:
		c+=1
print c

Submission status: Wrong Answer

Solution code:

n = int(raw_input())
c = 2 * (n / 11)
n%= 11
if n >=6:
	c+=2
elif n < 6:
	if n:
		c+=1
print c

Submission status: Wrong Answer

Solution code:
x=int(input())
y=19

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

Submission status: Wrong Answer

Solution code:
x=int(input())
y=19
z=[5,11,15]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x=int(input())

if x%11==6 or 8 or 9 or 10 :
    ans=(x//11)*2+2

elif 1<=x%11<=5:
    ans=(x//11)*2+1

elif (x)%11==7:
    ans=(x//11)*2+3

print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())

if x==2:
    ans=0

elif x%11==0:
    ans=(x//11)*2

elif 1<=x%11<=5:
    ans=(x//11)*2+1

elif x%11>5:
    ans=(x//11)*2+2

print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())

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

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

if x%11>5:
    ans=(x//11)*2+2

print(ans)

Submission status: Wrong Answer

Solution code:
x=int(input())

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

if x%11>5:
    ans=(x//11)*2+2

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())

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

Submission status: Wrong Answer

Solution code:
# 6, 5, 6, 5, ...

x = int(input())
q = x // 11
r = x % 11
if r == 0:
    ans = q * 2
elif 1 <= r <= 5:
    ans = q * 2 + 1
elif 6 <= r <= 10:
    ans = q * 2 + 2
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
import sys
import math
x=int(input())
if not ( 1 <= x <= 10**15 ): sys.exit()

print(1) if x <= 6 else print(math.ceil((x/11)*2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
k=N//11
s=N-(k*11)
if s==0:
  print(k*2)
elif s<=5:
  print(2*k+1)
else:
  print(2*k+2)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

s = x // 11 * 2 + 1

print(s)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
n=int(input())
cnt=(2*n)//11
if 0<(2*n)%11<=6:
    cnt+=1
elif (2*n)%11>7:
    cnt+=2
print(cnt)

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
if x == 6:
  x -= 1  
print(math.ceil(x/5.5))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())

x = I()

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print (ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())

p=x//11
q=x%11
q2=q-6

if q2>0:
  print(2*p+2)
else:
  print(2*p+1)

Submission status: Wrong Answer

Solution code:
x = int(input())

N=2*(x//11)

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

Submission status: Wrong Answer

Solution code:
import math
def main():
    x = int(input())
    if(x>6):
        res = 1
    if(x%11<=6):
        a = math.ceil((x+5)/11)
        b = a-1
        print(a+b)
    else:
        a=math.ceil((x)/11)
        b=a
        print(a+a)
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

ans = int(x//5.5)

x %= 11

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(math.ceil(x/5.5))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
cnt = (x-1) // 11
mod = x % 11

if mod <= 6:
  ans = 2 * cnt + 1
else:
  ans = 2 * cnt + 2
print(ans)

Submission status: Wrong Answer

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

    print(cnt)

if  __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

# 考え：初めに５の面を上にし、６、５、６、５の面を繰り返し上にしていくと良さそう
# 方針：while中、奇数回目にsから６を引く、偶数回目にsから５を引くことを繰り返す計算を行う

# この方法だとsが大きい場合、計算に時間がかかる
"""
while s > 0:
    if count == 0 or count % 2 != 0:
        s = s - 6
    else:
        s = s - 5

    count += 1
"""

# 方針：6、5、6、5...の繰り返しなので11で割った商と
#       余りが6以下なら1回サイコロを動かし、それ以外なら2回動かせば良い

count = s // 11 * 2

if s % 11 <= 6:
    count += 1
else:
    count += 2

print(count)

Submission status: Wrong Answer

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

if x<=6:
    print(1)
elif x<=11:
    print(2)
else:
    ans = math.ceil(x//11)*2
    res = (x%11)*2
    if res==0:
        res =0
    elif res<=6:
        res = 1
    elif res<=11:
        res = 2
    print(ans+res)

Submission status: Wrong Answer

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

if x<=5:
    print(1)
elif x<=11:
    print(2)
else:
    ans = math.ceil(x//11)*2
    res = (x%11)*2
    if res==0:
        res =0
    elif res<=5:
        res = 1
    elif res<=11:
        res = 2
    print(ans+res)

Submission status: Wrong Answer

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

if x<=5:
    print(1)
elif x<=11:
    print(2)
else:
    ans = math.ceil(x//11)*2
    res = (x%11)*2
    if res<=5:
        res = 1
    elif res<=11:
        res = 2
    print(ans+res)

Submission status: Wrong Answer

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

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:
s = int(input())
count = 0

# 考え：初めに５の面を上にし、６、５、６、５の面を繰り返し上にしていくと良さそう
# 方針：while中、奇数回目にsから６を引く、偶数回目にsから５を引くことを繰り返す計算を行う

while s > 0:
    if count == 0 or count % 2 != 0:
        s = s - 6
    else:
        s = s - 5

    count += 1

print(count)

Submission status: Wrong Answer

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

    ans = n * 2 / 11

    n -= 11 * n / 11

    if n == 0:
        pass
    elif n <= 6:
        ans += 1
    else:
        ans += 2

    print(ceil(ans))
 
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

    ans = n // 5.5

    if n % 100 <= 6:
        ans += 1
    else:
        ans += 2

    print(int(ans))
 
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

    ans = n // 5.5

    if n % 100 <= 6:
        ans += 1
    else:
        ans += 2

    print(ans)
 
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

    print(ceil(n/5.5))
 
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())

x=n//11
y=n%11
if y==0:
  y=0
elif y<6:
  y=1
else:
  y=2

print(x*2+y)

Submission status: Wrong Answer

Solution code:
n=int(input())

x=n//11
y=n%11

if y<6:
  y=1
else:
  y=2
print(x*2+y)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

elif x < 7:
    print(1)
    
else:
    print(2)

Submission status: Wrong Answer

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

elif x < 7:
    print(1)
    
else:
    print(2)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

elif x < 7:
    print(1)
    
else:
    print(2)

Submission status: Wrong Answer

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

elif x < 7:
    print(1)
    
else:
    print(2)

Submission status: Wrong Answer

Solution code:
x = int(input())

cnt = x // 11
x -= 11 * cnt
cnt = cnt * 2 + 1
if x > 6:
   cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu Jun 11 17:09:47 2020

@author: sd18016
"""   

x = int(input())

if x <= 6:
    print("1")
elif x <= 11:
    print("2")
else:
    a = x // 11
    b = x % 11
    if b == 0:
        print(2*a)
    elif 0 < b < 6:
        print(2*a+2)
    else:
        print(2*a+1)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu Jun 11 17:09:47 2020

@author: sd18016
"""   

x = int(input())

if x <= 6:
    print("1")
elif x <= 11:
    print("2")
else:
    a = x // 11
    b = x % 11
    if b == 0:
        print(2*a)
    elif b < 6:
        print(2*a+2)
    else:
        print(2*a+1)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu Jun 11 17:09:47 2020

@author: sd18016
"""   

x = int(input())

ans = 0
count = 0

if x <= 6:
    print("1")
elif x <= 11:
    print("2")
else:
    a = x // 11
    b = x % 11
    if b > 6:
        print(2*a+2)
    else:
        print(2*a+1)