# UTS Programming Competition 2019 Problem 2

### From ProgSoc Wiki

Revision as of 02:43, 14 September 2019 by Tomchristmas (Talk | contribs)

This is a part of the UTS Programming Competition 2019 Problem Set.

# Problem 2: Good Integers

*Run time limit: 1 second*

## Problem Description

A *good integer* is a whole number that is divisible by 7 but not divisible by 5. For example, 14
and 21 are good integers, but 5 and 35 are not.
Given an integer n, find the minimum good integer m such that m>=n.

## Data Specification

**Input**

Each test case has only one line containing an integer n (1<=n<=1000).

**Output**

For each test case output one line containing one integer, indicating the value of m.

### Sample Input 1

1

### Sample Output 1

7

### Sample Input 2

7

### Sample Output 2

7

### Sample Input 3

20

### Sample Output 3

21

### Sample Input 4

30

### Sample Output 4

42

## Solutions

Put your solutions here!