C :

#include<stdio.h>

void main() {
    int n,s=0,c=0;
    scanf("%d",&n);
    
    while(n!=0){
        if(n%10%2==0){
            s=s+n%10;
        }
        c++;
        n=n/10;
    }
    printf("%d %d",c,s);
}

C++ :

#include <bits/stdc++.h>
using namespace std;

int main(){
	string s;
	getline(cin,s);
	int x = 0;
	int i;
	for(i = 0;i < s.size();i++){
		if((s[i] - 48) % 2 == 0){
			x += (s[i] - 48);
		}
	}
	
	cout<<s.size()<<" "<<x<<endl;
	 
    return 0;
}

Pascal :

var a,b,c,s:longint;
begin
read(a);
s:=1;
while a>=10 do
begin
s:=s+1;
b:=a mod 10;
if b mod 2=0 then c:=c+b;
a:=a div 10;
end;
if a mod 2=0 then c:=c+a;
write(s,' ',c);
end.

Java :

import java.util.Scanner;


public class Main {
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		int a=sc.nextInt();
       String s=String.valueOf(a);
       String[] a1=s.split("");
       int c1=s.length();
       int c2=0;
       for(int i=1;i<=c1;i++){
    	   if(Integer.parseInt(a1[i])%2==0){
    		   c2+=Integer.parseInt(a1[i]);
    	   }
       }
       System.out.println(c1+" "+c2);
	}
}

Python :

n = input()  #接收输入值
su = 0     #初始化总和
i = 0      #初始化下标
print(len(n), end=' ')    #输出数字位数
while i < len(n):      #循环遍历每一位,找出偶数,加到总和中去
    k = int(n[i])
    if k % 2 == 0:
        su = su + k
    i += 1
print(su)