n=int(input())
while sum(map(int,str(n)))%4:
n=n+1
print(n)#include <bits/stdc++.h>
using namespace std;
bool checker(int n){
int sum=0;
while(n>0){
int tes=n%10;
sum+=tes;
n/=10;
}
if(sum%4==0)
return true;
else
return false;
}
int main() {
// your code goes here
int n;
cin>>n;
int ans1=n;
while(!checker(ans1)){
ans1++;
}
cout<<ans1<<endl;
return 0;
}
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |